#include <bits/stdc++.h>
namespace // to fold that junk code
{
#define filein(x) freopen(x".in", "r", stdin);
#define file(x) freopen(x".in", "r", stdin), freopen(x".out", "w", stdout);
#define files(x) freopen(x".in", "r", stdin), freopen(x".ans", "w", stdout);
using namespace std;
#define cT const T&
template<typename T>
inline T chkmin(T& x, cT y){if (x > y) x = y; return x;}
template<typename T>
inline T chkmax(T& x, cT y){if (x < y) x = y; return x;}
template <typename T>
inline bool inrange(cT x, cT l, cT r){return (l <= x) && (x <= r);}
template <typename T>
inline bool inrange(cT l, cT r, cT L, cT R){return (L <= l) && (r <= R);}
#undef cT
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef unsigned u32;
template <typename T>
using pr = pair<T, T>;
typedef pr<int> pii;
typedef pr<ll> pll;
typedef pr<db> pdd;
typedef complex<double> cp;
typedef vector<int> vi;
inline void YN(bool x){puts(x ? "YES" : "NO");}
}
const int N = 305, M = 2e6 + 233;
int n, m, k, a[M], id[N << 1], S;
deque<int> st[N];
struct Op{int opt, s1, s2;};
vector<Op> op;
inline void op1(int s){op.emplace_back(Op({1, s}));}
inline void op2(int s1, int s2){op.emplace_back(Op({2, s1, s2}));}
queue<int> q;
inline bool meow(int x)
{
	int bel = id[x];
	if (!bel)
	{
		if (q.empty()) return false;
		bel = id[x] = q.front(); q.pop(); op1(bel); st[bel].emplace_back(x);
	}
	else
	{
		id[x] = 0; q.push(bel);
		if (x == st[bel].back()){op1(bel); st[bel].pop_back();}
		else{op1(S); op2(S, bel); st[bel].pop_front();}
	}
	return true;
}
int main()
{
#ifndef ONLINE_JUDGE
	file("i");
#endif
	int T; scanf("%d", &T);
	while (T--)
	{
		scanf("%d%d%d", &n, &m, &k);
		for (int i=1; i<=m; i++) scanf("%d", a+i);
		if (n == 1){printf("%d\n", m); while (m--) puts("1 1"); continue;}
		memset(id, 0, sizeof id); op.clear(); S = n;
		while (!q.empty()) q.pop();
		for (int i=1; i<n; i++) q.push(i), q.push(i);
		for (int i=1; i<=m; i++)
		{
			if (meow(a[i])) continue;
			int pos = i + 1;
			while ((pos <= m) && (a[pos] != a[i]) && (st[id[a[pos]]].back() == a[pos])) ++pos;
			if (a[pos] == a[i]){op1(S); for (int j=i+1; j<pos; j++) meow(a[j]); op1(S); i = pos; continue;}
			int bel = id[a[pos]], bot = st[bel].back(), cc = 0;
			for (int j=i+1; j<pos; j++) cc += (a[j] == bot);
			if (cc & 1)
			{
				op1(S); st[S].emplace_back(a[i]);
				for (int j=i+1; j<pos; j++) (a[j] == bot) ? op1(bel) : (void)meow(a[j]);
				op1(bel); st[bel].clear(); id[a[pos]] = id[bot] = 0; id[a[i]] = S; q.push(S); S = bel;
			}
			else
			{
				op1(bel); st[bel].emplace_back(a[i]);
				for (int j=i+1; j<pos; j++) (a[j] == bot) ? op1(S) : (void)meow(a[j]);
				op1(S); op2(S, bel); st[bel].pop_front(); id[a[pos]] = 0; id[a[i]] = bel;
			}
			i = pos;
		}
		printf("%lu\n", op.size());
		for (Op e : op)
		{
			printf("%d %d", e.opt, e.s1);
			if (e.opt == 2) printf(" %d", e.s2);
			puts("");
		}
	}
	return 0;
}