B'You are given a deck of n cards numbered from 1 to n (not necessarily in this order in the deck). You have to sort the deck by repeating the following operation. You have to obtain a sorted deck (i.e., a deck where the first card is 1 , the second is 2 and so on) performing at most n operations. It can be proven that it is always possible to sort the deck performing at most n operations. Examples of operation: The following are three examples of valid operations (on three decks with different sizes). The first line of the input contains one integer n ( 1 <= n <= 52 ) -- the number of cards in the deck. The second line contains n integers c_1, c_2, ... , c_n -- the cards in the deck. The first card is c_1 , the second is c_2 and so on. It is guaranteed that for all i=1, ... ,n there is exactly one j in {1, ... ,n } such that c_j = i . On the first line, print the number q of operations you perform (it must hold 0 <= q <= n ). Then, print q lines, each describing one operation. To describe an operation, print on a single line the number k of parts you are going to split the deck in, followed by the size of the k parts: |D_1|, |D_2|, ... , |D_k| . It must hold 2 <= k <= n , and |D_i| ge 1 for all i=1, ... ,k , and |D_1|+|D_2|+ cdots + |D_k| = n . It can be proven that it is always possible to sort the deck performing at most n operations. If there are several ways to sort the deck you can output any of them. Explanation of the first testcase: Initially the deck is [3 1 2 4]. '...