#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int)1e9 + 23111992;
const long long LINF = (long long)1e18 + 23111992;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline unsigned long long isqrt(unsigned long long k) {
  unsigned long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int myrand() { return abs((int)mt()); }
const int maxn = 1e5 + 5;
int n;
int a[maxn];
int used[maxn];
vector<int> work1() {
  static int f[maxn];
  static int p[maxn];
  int t = 0;
  pair<int, int> best;
  for (int i = (0); i < (n); ++i) {
    int k = lower_bound(f, f + t, a[i]) - f;
    chkmax(t, k + 1);
    f[k] = a[i];
    if (k) p[a[i]] = f[k - 1];
    chkmax(best, make_pair(k + 1, a[i]));
  }
  vector<int> res;
  int st = best.second;
  for (int i = (0); i < (best.first); ++i) {
    res.push_back(st);
    st = p[st];
  }
  reverse((res).begin(), (res).end());
  return res;
}
void work2(vector<vector<int> >& res) {
  static int f[maxn];
  static int p[maxn];
  int t = 0;
  for (int i = (0); i < (n); ++i) {
    int k = lower_bound(f, f + t, a[i]) - f;
    chkmax(t, k + 1);
    f[k] = a[i];
    p[a[i]] = k;
  }
  int c = int((res).size());
  res.resize(c + t);
  for (int i = (0); i < (n); ++i) {
    res[c + p[a[i]]].push_back(a[i]);
  }
}
void chemthan() {
  int test;
  cin >> test;
  while (test--) {
    cin >> n;
    for (int i = (0); i < (n); ++i) cin >> a[i], a[i]--, used[i] = 1;
    vector<vector<int> > res;
    while (n) {
      int k = 0;
      while (k * (k + 1) / 2 <= n) k++;
      vector<int> r = work1();
      if (k * (k - 1) / 2 <= n - int((r).size())) {
        break;
      }
      for (int x : r) {
        used[x] = 0;
      }
      res.push_back(r);
      static int b[maxn];
      int nn = 0;
      for (int i = (0); i < (n); ++i)
        if (used[a[i]]) {
          b[nn++] = a[i];
        }
      n = nn;
      for (int i = (0); i < (n); ++i) a[i] = b[i];
    }
    work2(res);
    cout << int((res).size()) << "\n";
    for (auto it : res) {
      cout << int((it).size()) << " ";
      for (int i = (0); i < (int((it).size())); ++i)
        cout << it[i] + 1 << " \n"[i == int((it).size()) - 1];
    }
  }
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  if (argc > 1) {
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    assert(freopen(argv[2], "wb", stdout));
  }
  chemthan();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
