#include <bits/stdc++.h>
using namespace std;
template <typename num_t>
inline void add_mod(num_t& a, const long long& b, const int& m) {
  a = (a + b) % m;
  if (a < 0) a += m;
}
template <typename num_t>
inline bool update_max(num_t& a, const num_t& b) {
  return a < b ? a = b, true : false;
}
template <typename num_t>
inline bool update_min(num_t& a, const num_t& b) {
  return a > b ? a = b, true : false;
}
template <typename num_t>
num_t gcd(num_t lhs, num_t rhs) {
  return !lhs ? rhs : gcd(rhs % lhs, lhs);
}
template <typename num_t>
num_t pw(num_t n, num_t k, num_t mod) {
  num_t res = 1;
  for (; k > 0; k >>= 1) {
    if (k & 1) res = 1ll * res * n % mod;
    n = 1ll * n * n % mod;
  }
  return res;
}
const int inf = 1e9 + 7;
const int mod = inf;
const long long ll_inf = 9ll * inf * inf;
const int MAX_N = 1e5 + 7;
vector<vector<int>> res;
vector<int> stack_[MAX_N];
int trace[MAX_N];
void calc(vector<int>& a, int k) {
  for (int i = (0), _b = ((int)(a).size() + 1); i < _b; ++i) stack_[i].clear();
  for (int x : a) trace[x] = 0;
  int m = 0;
  for (int i = (0), _b = ((int)(a).size()); i < _b; ++i) {
    int lo = 1, hi = m, found = 0;
    while (lo <= hi) {
      int mid = (lo + hi) >> 1;
      if (stack_[mid].back() < a[i]) {
        found = mid;
        lo = mid + 1;
      } else
        hi = mid - 1;
    }
    if (found) {
      trace[a[i]] = stack_[found].back();
    }
    ++found;
    stack_[found].push_back(a[i]);
    update_max(m, found);
  }
  if (m <= k) {
    for (int i = (1), _b = ((int)(a).size() + 1); i < _b; ++i)
      if (!stack_[i].empty()) res.push_back(move(stack_[i]));
  } else {
    int u = stack_[m].back();
    vector<int> temp(m);
    for (int i = 0; i < m; ++i) {
      temp[m - i - 1] = u;
      u = trace[u];
    }
    res.push_back(temp);
    vector<int> b(a.size() - m);
    for (int i = 0, temp_idx = 0, b_idx = 0; i < a.size(); ++i) {
      if (temp_idx < m && temp[temp_idx] == a[i]) {
        ++temp_idx;
        continue;
      }
      b[b_idx++] = a[i];
    }
    calc(b, k - 1);
  }
}
void solve() {
  int test;
  cin >> test;
  while (test-- > 0) {
    vector<int> a;
    int n;
    cin >> n;
    a.resize(n);
    for (int i = (0), _b = (n); i < _b; ++i) cin >> a[i];
    int k = 1;
    while (k * (k + 1) / 2 <= n) ++k;
    if (k * (k + 1) / 2 > n) --k;
    res.clear();
    calc(a, k);
    cout << res.size() << '\n';
    for (auto& arr : res) {
      cout << arr.size() << ' ';
      for (int x : arr) cout << x << ' ';
      cout << '\n';
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  const bool multiple_test = false;
  int test = 1;
  if (multiple_test) cin >> test;
  for (int i = 0; i < test; ++i) {
    solve();
  }
}
