#include <stdio.h>
#define NN 10001000
#define N 1100
#define MAX 10000000

int b[N];
int p[NN][2];
int gl[NN];
int bn,g,n;

int main()
{
	int i,j,p1;
	int cases,cc;
	int poc,typ,max,maxkde;

	scanf("%d", &cases);
	for ( cc=0; cc<cases; cc++ )
	{
		printf("Case %d:\n", cc+1);
		scanf("%d %d %d", &bn, &g, &n);	
		p[MAX][0]=-1;
		for ( i=0; i<g; i++ ) gl[i]=1000001;
		for ( i=0; i<n; i++ ) 
		{
			scanf("%d", &p1); p1--;
			p[gl[p1]][1]=i;
			p[i][0]=p1;
			gl[p1]=i;
		}
		for ( i=0; i<g; i++ ) p[gl[i]][1]=MAX;

//		for ( i=0; i<n; i++ ) printf("%d ", p[i][1]); printf("\n");
		
		poc=0;
		for ( i=0; poc<bn; i++ ) 
		{
			for ( j=0; j<poc; j++ ) 
				if (p[b[j]][0]==p[i][0]) break;
			if (j==poc)	
			{
				b[poc]=p[i][1];
				printf("LOAD %d %d\n", poc+1,p[i][0]+1);
				poc++;
			}
			else {b[j]=p[b[j]][1]; printf("NO ACTION\n");}			
		}

		for ( ;i<n; i++ )
		{		
			max=-1; typ=p[i][0];
		//	printf("%d %d %d\n", b[0], b[1], typ);
			for ( j=0; j<bn; j++ )
			{
				if (max<b[j]) {max=b[j]; maxkde=j;}
				if (p[b[j]][0]==typ) break;
			}
			if (j==bn)
			{
				printf("LOAD %d %d\n", maxkde+1, typ+1);
				b[maxkde]=p[i][1];
			}
			else
			{
				b[j]=p[b[j]][1];
				printf("NO ACTION\n");
			}
		}
		
		if (cc!=cases-1) printf("\n");
	}		
	
	return 0;
}