Problem: One Saturday afternoon Egor was playing his favorite RPG game. While discovering new lands and territories, he came across the following sign:

<image>

Egor is a passionate player, but he is an algorithmician as well. That's why he instantly spotted four common letters in two words on the sign above — if we permute the letters "R", "E", "G", "O" from the first word, we can obtain the letters "O", "G", "R", "E". Egor got inspired by the sign and right away he came up with a problem about permutations.

You are given a permutation of length n. You have to split it into some non-empty subsequences so that each element of the permutation belongs to exactly one subsequence. Each subsequence must be monotonic — that is, either increasing or decreasing.

Sequence is called to be a subsequence if it can be derived from permutation by deleting some (possibly none) elements without changing the order of the remaining elements.

The number of subsequences should be small enough — let f(n) be the minimum integer k such that every permutation of length n can be partitioned into at most k monotonic subsequences.

You need to split the permutation into at most f(n) monotonic subsequences.

Input

The first line contains one integer t (1 ≤ t ≤ 10^5) — the number of test cases.

You can only use t = 1 in hacks.

Next, descriptions of t test cases come, each of them in the following format.

The first line of a single test case contains one integer n (1 ≤ n ≤ 10^5) — the length of the permutation. The second line contains n distinct integers a_i (1 ≤ a_i ≤ n) — the permutation itself.

The sum of the values of n over all test cases doesn't exceed 10^5.

Output

For each test case print the answer in the following format:

In the first line print k (1 ≤ k ≤ f(n)) — the number of the subsequences in the partition. In the next k lines, print the descriptions of found subsequences. Each description should start with a number l_i (1 ≤ l_i ≤ n) — the length of the corresponding subsequence, followed by l_i integers — the values of this subsequence in the order in which they occur in the permutation.

Each subsequence you output must be either increasing or decreasing. 

In case there are multiple possible answers, print any of them.

Example

Input


3
4
4 3 1 2
6
4 5 6 1 3 2
10
1 2 3 4 5 6 7 8 9 10


Output


2
3 4 3 1
1 2
3
2 4 1
2 5 6
2 3 2
1
10 1 2 3 4 5 6 7 8 9 10

Note

In the example, we can split:

  * [4, 3, 1, 2] into [4, 3, 1], [2] 
  * [4, 5, 6, 1, 3, 2] into [4, 1], [5, 6] and [3, 2] 
  * [1, 2, 3, 4, 5, 6, 7, 8, 9, 10] into [1, 2, 3, 4, 5, 6, 7, 8, 9, 10] 



Surely, there are many more answers possible.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline int gi() {
  int data = 0, m = 1;
  char ch = 0;
  while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
  if (ch == '-') {
    m = 0;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    data = (data << 1) + (data << 3) + (ch ^ 48);
    ch = getchar();
  }
  return (m) ? data : -data;
}
int n, nA, nI, K, A[100005], q[100005], np, ps, cov[100005], ID[100005],
    f[100005];
vector<int> ans[100005];
struct Item {
  int vl, id;
  inline bool operator<(const Item &B) const {
    return vl ^ B.vl ? vl < B.vl : id < B.id;
  }
};
set<Item> S;
set<Item>::iterator it, pre;
inline void solve() {
  S.clear();
  nI = 0;
  for (int i = n; i >= 1; i--) {
    S.insert((Item){A[i], 0});
    it = S.find((Item){A[i], 0});
    if (it == S.begin()) {
      ++nI;
      S.erase(it);
      S.insert((Item){A[i], nI});
      ID[i] = nI;
    } else {
      pre = it;
      --pre;
      ID[i] = (*pre).id;
      S.erase(pre);
      S.erase(S.find((Item){A[i], 0}));
      S.insert((Item){A[i], ID[i]});
    }
  }
  for (int j = 1; j <= n; j++) ans[nA + ID[j]].push_back(A[j]);
  nA += nI;
  return;
}
inline void Work() {
  n = gi();
  for (int i = 1; i <= n; i++) A[i] = gi(), cov[i] = 0;
  nA = 0;
  K = 1;
  while (K * (K + 1) / 2 <= n) ++K;
  for (int i = 1; i <= K; i++) ans[i].clear();
  while (1989) {
    np = 0;
    ps = 0;
    for (int i = 1, p; i <= n; i++) {
      p = upper_bound(q + 1, q + np + 1, A[i]) - q;
      q[p] = A[i];
      f[i] = p;
      if (p > np) np = p;
      if (f[ps] < f[i]) ps = i;
    }
    if (f[ps] < K) {
      solve();
      break;
    }
    cov[ps] = K;
    for (int j = ps - 1; j >= 1; j--)
      if (f[j] == f[ps] - 1 && A[j] < A[ps]) ps = j, cov[ps] = K;
    ++nA;
    np = 0;
    for (int j = 1; j <= n; j++)
      if (cov[j] == K)
        ans[nA].push_back(A[j]);
      else
        q[++np] = A[j];
    if (!np) break;
    for (int j = 1; j <= np; j++) A[j] = q[j];
    n = np;
    --K;
  }
  printf("%d\n", nA);
  for (int i = 1; i <= nA; i++, puts("")) {
    printf("%d ", (int)ans[i].size());
    for (int j = 0, lt = ans[i].size(); j < lt; j++) printf("%d ", ans[i][j]);
  }
}
int main() {
  int Case = gi();
  while (Case--) Work();
  return 0;
}