#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const int INF2 = 0x3f3f3f3f;
const long long INF64 = 1e18;
const double INFD = 1e30;
const double EPS = 1e-9;
const double PI = acos(-1);
const int MOD = 998244353;
template <typename T>
inline T read() {
  T X = 0, w = 0;
  char ch = 0;
  while (!isdigit(ch)) {
    w |= ch == '-';
    ch = getchar();
  }
  while (isdigit(ch)) X = (X << 3) + (X << 1) + (ch ^ 48), ch = getchar();
  return w ? -X : X;
}
const int MAXN = 200005;
int n, m, k;
int dr[4] = {1, 0, -1, 0};
int dc[4] = {0, 1, 0, -1};
int dr2[8] = {1, 1, 1, -1, -1, -1, 0, 0};
int dc2[8] = {1, 0, -1, 1, 0, -1, 1, -1};
int CASE = 1;
template <typename T>
struct List {
  T* data;
  int sz;
  List() : data(nullptr), sz(0) {}
  ~List() {
    if (data) delete data;
  }
};
int arr[MAXN];
pair<int, int> s() {
  set<int> stt;
  set<int> stt2;
  int i = 1;
  for (; i <= n; i++) {
    if (!stt.count(arr[i]))
      stt.insert(arr[i]);
    else
      break;
  }
  for (int i = 1; i <= stt.size(); i++) {
    if (!stt.count(i)) return {-1, -1};
  }
  for (; i <= n; i++) {
    if (!stt2.count(arr[i]))
      stt2.insert(arr[i]);
    else
      break;
  }
  for (int i = 1; i <= stt2.size(); i++) {
    if (!stt2.count(i)) return {-1, -1};
  }
  if (i <= n) return {-1, -1};
  return {stt.size(), stt2.size()};
}
void solve() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    arr[i] = read<int>();
  }
  vector<pair<int, int>> c;
  auto x = s();
  if (x.first != -1) c.push_back(x);
  reverse(arr + 1, arr + n + 1);
  x = s();
  if (x.first != -1 &&
      (c.empty() || (pair<int, int>){x.second, x.first} != c.back()))
    c.push_back({x.second, x.first});
  printf("%d\n", c.size());
  for (auto a : c) {
    printf("%d %d\n", a.first, a.second);
  }
}
int main() {
  int T = read<int>();
  while (T--) {
    solve();
  }
  return 0;
}
