15分求调

#include<bits/stdc++.h>
using namespace std;
int n,m,k,A[2000005],instk[1001],down[601],up[601];
deque<int>q[10001];
inline string str(int x)
{
	string ans="";
	while(x)
	{
		ans=" "+ans;
		ans[0]=x%10+'0';
		x/=10;
	}
	return ans;
}
inline void solve()
{
	for(int i = 1;i <=1000;i++)instk[i]=0;
	scanf("%d %d %d",&n,&m,&k);
	for(int i = 1;i <=m;i++)scanf("%d",&A[i]);
	int steps=0;string ans="\n";
	for(int i = 1;i <=n;i++)while(q[i].size())q[i].pop_front();
	for(int asdf = 1;asdf <=m;asdf++)
	{
		int cur=A[asdf],emptystack,num=0,slv=false;
		/*if(asdf!=m&&cur==A[asdf+1])
		{
			ans+="1 1\n1 1\n";
			steps+=2;
			asdf++;
			continue;
		}*/
		for(int j = 1;j <=n;j++)
			if(!q[j].size())
			{
				emptystack=j;
				num++;
				if(num>=2)break;
			}
		for(int j = 1;j <=n;j++)
			if(q[j].size()&&q[j].front()==cur)
			{
				slv=true;
				steps+=2;
				ans+="1 "+str(emptystack)+"\n2 "+str(j)+" "+str(emptystack)+"\n";
				instk[cur]=0;
				q[j].pop_front();
				break;
			}
			else if(q[j].size()&&q[j].back()==cur)
			{
				steps++;
				slv=true;
				ans+="1 "+str(j)+"\n";
				instk[cur]=0;
				q[j].pop_back();
				break;
			}
			else;
		if(slv)continue;
		if(num>=2)
		{
			ans+="1 "+str(emptystack)+"\n";
			q[emptystack].push_back(cur);
			instk[cur]=1;
			steps++;
			continue;
		}
		for(int j = 1;j <=n;j++)
			if(q[j].size()==1)
			{
				ans+="1 "+str(j)+"\n";
				steps++;
				slv=true;
				instk[cur]=1;
				q[j].push_back(cur);
				break;
			}
		if(slv)continue;
		int j;
		for(int i = 1;i <=k;i++)down[i]=0,up[i]=0;
		for(int i = 1;i <=n;i++)
			if(q[i].size())
				down[q[i].front()]=i,up[q[i].back()]=i;
		for(j = asdf+1;j<=n;j++)if(down[j])break;
		bool tag=false;
		for(int i = asdf+1;i<j;i++)
			if(q[up[A[i]]].front()==A[j])
			{
				tag=true;
				break;
			}
		if(tag)
		{
			steps++;
			ans+="1 "+str(emptystack)+"\n";
			q[emptystack].push_back(cur);
			instk[cur]=1;
			for(int i = asdf+1;i<j;i++)
			{
				steps++;
				ans+="1 "+str(up[A[i]])+"\n";
				instk[q[up[A[i]]].back()]=0; 
				q[up[A[i]]].pop_back();
			}
			steps++;
			ans+="1 "+str(down[A[j]])+"\n";
			instk[q[down[A[j]]].front()]=0;
			q[down[A[j]]].pop_front();
		}
		else
		{
			steps++;
			ans+="1 "+str(down[A[j]])+"\n";
			q[down[A[j]]].push_back(A[asdf]);
			instk[A[asdf]]=1;
			for(int i = asdf+1;i<j;i++)
			{
				steps++;
				ans+="1 "+str(up[A[i]])+"\n";
				instk[q[up[A[i]]].back()]=0;
				q[up[A[i]]].pop_back();
			}
			steps+=2;
			ans+="1 "+str(emptystack)+"\n2 "+str(emptystack)+" "+str(down[A[j]])+"\n";
			instk[q[down[A[j]]].front()]=0;
			q[down[A[j]]].pop_front();
		}
		asdf=j;
	}
	printf("%d",steps);
	for(int i = 0;i <ans.size();i++)putchar(ans[i]);
	return;
}
int main()
{
	int T;cin>>T;
	while(T--)solve();
}