#include <stdio.h>

struct node
{
	int kt;
	int val;
};

struct node h[1010];
int hn;

int swap(int x,int y)
{
	int p;
	p=h[x].kt;
	h[x].kt=h[y].kt;
	h[y].kt=p;
	p=h[x].val;
	h[x].val=h[y].val;
	h[y].val=p;	
	return 0;
}

int ins(int kt,int val)
{
	int i;
	h[++hn].kt=kt;
	h[hn].val=val;
	i=hn;
	while ((i>1)&&(h[i].val>h[i/2].val))
	{
		swap(i,i/2);
		i/=2;
	}
	return 0;
}

int pop(int * ktory)
{
	int ret,i,max;
	ret=h[1].kt;
	swap(1,hn);
	hn--;
	i=1;
	while (1)
	{
		if (i*2>hn) break;
		max=i;
		if (h[2*i].val>h[max].val) max=2*i;
		if (i*2+1<=hn)
		{
			if (h[2*i+1].val>h[max].val) max=2*i+1;
		
		}
		if (max==i) break;
		swap(i,max);
		i=max;
	}
	return ret;
}

int main()
{
	int ii,nn;
	int i,j,n,b,g,x;
	short int s[1010000];
	int naj[1010000];
	char in[1010000];
	int kedy[1010000];
	int bays[1010];
	scanf("%d",&nn);
	for (ii=0;ii<nn;ii++)
	{
		hn=0;
		printf("Case %d:\n",ii+1);
		scanf("%d %d %d",&b,&g,&n);
		for (i=0;i<n;i++) scanf("%i",&(s[i]));
		for (i=0;i<g;i++) in[i]=0;
		for (i=0;i<b;i++) bays[i]=g+1;
		for (i=0;i<g;i++) kedy[i]=2*n+100;
		for (i=n-1;i>=0;i--) 
		{
			naj[i]=kedy[s[i]];
			kedy[s[i]]=i;
		}
		for (i=0;i<n;i++)
		{
		
/*			for (x=0;x<b;x++) printf("%d ",bays[x]);
			printf("\n");*/
		if (in[s[i]]) printf("NO ACTION\n"); else
		if (hn==b)
		{
			pop(&j);
			printf("LOAD %d %d\n",j+1,s[i]);
			in[bays[j]]=0;
			in[s[i]]=1;
			bays[j]=s[i];
			ins(j,naj[i]);
		} else
		{
			j=0;
			while (bays[j]!=g+1) j++;
/*			printf(" load \n");*/
			printf("LOAD %d %d\n",j+1,s[i]);
			in[s[i]]=1;
			bays[j]=s[i];
			ins(j,naj[i]);
		}
		}
	}
	return 0;
}