# include <iostream>
# include <cstdio>
# include <cmath>
# include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
const int distance1=15;
const int numberofoperations=15;
const double pet=50;
int n,k;
int p[15][4];
int r[301][301];
int g[301][301];
int b[301][301];
long long s[301][301];
bool visit[301][301];
int f[256];
struct square
{
    int x;
    int y;
    int ar;
    int ag;
    int ab;
    int ds;
};
square q[90005];

struct square2
{
    int x;
    int y;
    int av;
};
square2 h[90005];
int brq=0;
bool cmp(square2 i, square2 j)
{
    return i.av<j.av;
}
int brop=0;
int tekr,tekg,tekb;
double difference(int r1,int g1,int b1,int r2,int g2,int b2)
{
    double p;
    p=(r1-r2)*(r1-r2)+(g1-g2)*(g1-g2)+(b1-b2)*(b1-b2);
    return sqrt(p);
}
void printthis(int br)
{
    int x1=q[br].x-q[br].ds;
    int y1=q[br].y- q[br].ds;
    int x2=q[br].x-1;
    int y2=q[br].y-1;
    int i;
    double mindiff=difference(tekr,tekg,tekb,q[br].ar,q[br].ag,q[br].ab);
    double dif;
    int pal=k,pal1=10000;
    int fbrop=brop;
   // memset()
    while(brop<(90000-1)&&brop-fbrop<numberofoperations)
    {
        for(i=0;i<k;i++)
        {
            dif=difference((tekr+p[i][1])/2,(tekg+p[i][2])/2,(tekb+p[i][3])/2,q[br].ar,q[br].ag,q[br].ab);
            if(dif<mindiff){mindiff=dif;pal=i;}
        }
        if(pal==k||pal1==pal)break;
        pal1=pal;
        printf("1 %d\n",pal);
        brop++;
        tekr=(tekr+p[pal][1])/2;
        tekg=(tekg+p[pal][2])/2;
        tekb=(tekb+p[pal][3])/2;
       // if(brop%100==0)printf("%d\n",brop);
    }
    if(brop<90000){
    printf("3 %d %d %d %d\n",x1,y1,x2,y2);brop++;}
 //   if(brop%100==0)printf("%d\n",brop);

}
void bokluck()
{
    while(brop<90000)
    {
        printf("1 1\n");
        brop++;
    }
}
void makethetable()
{
   // cout<<n<<endl;
       int i,j,p,t1,t2;
      // double mins=100000000;
     //  double maxs=0;
       //double r;
       int minr=10000,ming=10000,minb=100000;
       int maxr=0,maxg=0,maxb=0;
       int sr,sg,sb;
       bool fl;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {

           if(visit[i][j])continue;
         //  cout<<"&&&"<<i<<" "<<j<<endl;
            for(p=min(14,n-i+1);p>0;p--)
            { fl=1;
            sr=0;
            sg=0;
            sb=0;
            minr=100000;
            ming=100000;
            minb=100000;
            maxr=0;
            maxg=0;
            maxb=0;
                for(t1=i;fl&&t1<=i+p-1;t1++)
                {
                    for(t2=j;t2<=j+p-1;t2++)
                    {
                     //   cout<<t1<<" "<<t2<<" "<<p<<endl;
                        if(visit[t1][t2]){fl=0;break;}
                        if(max(maxr,r[t1][t2])-min(minr,r[t1][t2])>distance1){fl=0;break;}
                        if(max(maxg,g[t1][t2])-min(ming,g[t1][t2])>distance1){fl=0;break;}
                        if(max(maxb,b[t1][t2])-min(minb,b[t1][t2])>distance1){fl=0;break;}
                        maxr=max(maxr,r[t1][t2]);
                        minr=max(minr,r[t1][t2]);
                        maxg=max(maxg,g[t1][t2]);
                        ming=max(ming,g[t1][t2]);
                        maxb=max(maxb,b[t1][t2]);
                        minb=max(minb,b[t1][t2]);
                        sr+=r[t1][t2];
                        sg+=g[t1][t2];
                        sb+=b[t1][t2];
                    }
          maxr=max(maxr,r[t1][t2]);
                        minr=max(minr,r[t1][t2]);      }
                  if(fl)break;
            }
            for(t1=i;t1<=i+p-1;t1++)
                for(t2=j;t2<=j+p-1;t2++)
                visit[t1][t2]=1;
            brq++;
            q[brq].x=i+p-1;
            q[brq].y=j+p-1;
            q[brq].ar=sr/(p*p);
            q[brq].ag=sg/(p*p);
            q[brq].ab=sb/(p*p);
            q[brq].ds=p;
          //  cout<<i<<" "<<j<<" "<<p<<endl;
          printthis(brq);
        }
    }
 bokluck();
}
int main()
{

    freopen ("drawing.in","r",stdin);

    scanf("%d%d",&n,&k);
    int i;
    int tch=1;
    int tb=0;

   // int j;
    //cout<<k<<endl;
    for(i=0;i<k;i++)
        scanf("%d%d%d",&p[i][1],&p[i][2],&p[i][3]);
//        int tch=1;
  //      int tb=0;
   // if(p[1][1]==255){tch=0;tb=1;}
    int j;if(p[1][1]==255){tch=0;tb=1;}
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            scanf("%d",&r[i][j]);
        }
    }
        for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            scanf("%d",&g[i][j]);
        }
    }



     freopen ("drawing.out","w",stdout);
       printf("90000\n");
          for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            scanf("%d",&b[i][j]);
            s[i][j]=r[i][j]+g[i][j]+b[i][j]+s[i-1][j]+s[i][j-1]-s[i-1][j-1];
          //  cout<<s[i][j]<<endl;
        }
    }
    long long a;
    for(i=2;i<=n;i+=2)
        for(j=2;j<=n;j+=2)
    {
        brq++;
        h[brq].x=i;
        h[brq].y=j;
        a=s[i][j]-s[i-2][j]-s[i][j-2]+s[i-2][j-2];
        h[brq].av=a/12;
    }
    sort(h+1,h+brq+1,cmp);

       double diff=0;
       for(i=1;i<n;i++)
       {
           diff+=difference(r[1][i],g[1][i],b[1][i],r[1][i+1],g[1][i+1],b[1][i+1]);
            diff+=difference(r[100][i],g[100][i],b[100][i],r[100][i+1],g[100][i+1],b[100][i+1]);
            diff+=difference(r[200][i],g[200][i],b[200][i],r[200][i+1],g[200][i+1],b[200][i+1]);
            diff+=difference(r[299][i],g[299][i],b[299][i],r[299][i+1],g[299][i+1],b[299][i+1]);
       }
       diff=diff/1200;
       if(diff<=pet)
 {makethetable();return 0;}

  int cur=0;
   int t;
   int brk=0;
memset(f,0,sizeof(f));
   cur =0;
   for(i=1;i<=brq;i++)
   {
        t=h[i].av;
        while(cur!=t&&f[cur]!=i)
        {
            f[cur]=i;
          // cout<<cur<<" "<<t<<endl;
            if(cur<t)
            {
                printf("1 %d\n",tch);
                brk++;
                cur=(cur+255)/2;
            }
            else
            {
                 printf("1 %d\n",tb);
                 brk++;
                cur=(cur)/2;
            }
            if(brk==90000)return 0;
        }
        printf("3 %d %d %d %d\n",h[i].x-2,h[i].y-2,h[i].x-1,h[i].y-1);
        brk++;
        if(brk==90000)return 0;
   }
   while(brk!=90000)
   {
       brk++;
       printf("1 0\n");
   }
return 0;


}