# include <bits/stdc++.h>
using namespace std;
const long long maxn = 505;
long long a[maxn][maxn],b[maxn][maxn],r[maxn],c[maxn],n,m,P,z[maxn][maxn];
long long ANS = 0;
long long ANS2;

vector <pair <char ,pair <long long,long long> > > answers,answers2;
mt19937 rand_Gen(54543654);
const clock_t begin_time = clock();
float Time = 1.8;
long long delta = 0;
void read()
{
    cin>>n>>m>>P;
    long long i,j;
    for(i=1;i<=n;i++)
    cin>>r[i];
    for(i=1;i<=m;i++)
        cin>>c[i];
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
              cin>>a[i][j];
              z[i][j] = a[i][j];
        }

    }
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        cin>>b[i][j];

}
void print()
{
    cout<<min(P,(long long)answers2.size())<<endl;
    long long i,j;
    for(i=0;i<min(P,(long long)answers2.size());i++)
        cout<<answers2[i].first<<" "<<answers2[i].second.first<<" "<<answers2[i].second.second<<endl;
}
void PRINT()
{
    cout<<min(P,(long long)answers.size())<<endl;
    long long i,j;
    for(i=0;i<min(P,(long long)answers.size());i++)
        cout<<answers[i].first<<" "<<answers[i].second.first<<" "<<answers[i].second.second<<endl;
}
long long calcresult(long long a[maxn][maxn], long long b[maxn][maxn])
{
    long long i,j;
    long long ans = 0;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        ans+=(a[i][j]*b[i][j]);
    return ans;
}
void rotate_horizontal(long long row, long long k)
{
   // cout<<row<<" & "<<k<<endl;
    long long w[maxn];
    long long i,j;
    for(i=1;i<=m;i++)
        w[i] = a[row][i];
    for(i=1;i<=m;i++)
    {
        long long id = (i+k+2*m-1)%m+1;
       // cout<<i<<"->"<<id<<endl;
        a[row][i] = w[id];
    }

}
void rotate_vertical(long long col, long long k)
{
    //cout<<col<<" ^ "<<k<<endl;
    long long w[maxn];
    long long i,j;
    for(i=1;i<=n;i++)
        w[i] = a[i][col];
    for(i=1;i<=n;i++)
    {
        long long id = (i+k+2*n-1)%n+1;
        //cout<<i<<"->"<<id<<endl;
        a[i][col] = w[id];
    }
    //cout<<"END"<<endl;
}
bool lefttime(double Time)
{
    return ( float( clock () - begin_time ) /  CLOCKS_PER_SEC<Time);
}
long long iterations = 0,successful = 0;
const long long maxitr = 50;
const long long every  = 10;
long long cases = 0;
void rotate()
{
    //cout<<"ROTATE"<<endl;
    while(1){
    if(!lefttime(Time))return ;
    //long long cases = rand_Gen()%2;
    if(successful>=every||iterations>=maxitr)
    {
        successful = 0;
        iterations = 0;
        cases = 1-cases;
    }
    long long i;
    iterations++;
    if(cases==0)
    {
        long long x = rand_Gen()%n+1;
        long long bestans = ANS; long long idx = 0;
        for(i=1;i<m;i++)
        {
            rotate_horizontal(x,i);
            if(calcresult(a,b)+r[x]+delta<bestans)
            {
                bestans = calcresult(a,b) + r[x]+delta;
                idx = i;
            }
            rotate_horizontal(x,-i);
        }
        if(idx!=0)
        {
            rotate_horizontal(x,idx);
            answers.push_back({'R',{x,idx}});
            ANS = bestans;
            delta+=r[x];
            successful++;
            return ;
        }
        /*
        ///long long nums = rand_Gen()%(m-1)+1;
        //cout<<"R "<<x<<" "<<nums<<endl;
        //rotate_horizontal(x,nums);

        if(calcresult(a,b)+r[x]<ANS)
        {
            ANS = calcresult(a,b)+r[x];
            answers.push_back({'R',{x,nums}});
            return ;
        }
        else
            rotate_horizontal(x,-nums);
        //cout<<"OK"<<endl;
    */
    }
    else
    {
        long long x = rand_Gen()%m+1;
        long long bestans = ANS; long long idx = 0;
        for(i=1;i<n;i++)
        {
            rotate_vertical(x,i);
            if(calcresult(a,b)+c[x]+delta<bestans)
            {
                bestans = calcresult(a,b) + c[x]+delta;
                idx = i;
            }
            rotate_vertical(x,-i);
        }
        if(idx!=0)
        {
            rotate_vertical(x,idx);
            answers.push_back({'C',{x,idx}});
            ANS = bestans;
            delta+=c[x];
            successful++;
            return ;
        }
        /*
        long long nums = rand_Gen()%(n-1)+1;

        //cout<<"C "<<x<<" "<<nums<<endl;
        rotate_vertical(x,nums);
        if(calcresult(a,b)+c[x]<ANS)
        {
            ANS = calcresult(a,b)+c[x];
            answers.push_back({'C',{x,nums}});
            return ;
        }
        else
            rotate_vertical(x,-nums);
        //cout<<"OK"<<endl;
        */
    }
}
   // rotate();
}
bool prohibr[maxn],prohibc[maxn];
bool rotatemaxrow()
{
    long long i,j;
    long long maxrow = 0,idx = -1,sum;
    for(i=1;i<=n;i++)
    {
        if(prohibr[i])continue;
        sum = 0;
        for(j=1;j<=m;j++)
        {
            sum+=a[i][j]*b[i][j];
        }
        if(sum>maxrow)
        {
            maxrow = sum;
            idx = i;
        }
    }
    if(idx==-1)return 0;
    prohibr[idx] = 1;
    long long x = idx;
     long long bestans = ANS; idx = 0;
        for(i=1;i<m;i++)
        {
            rotate_horizontal(x,i);
            if(calcresult(a,b)+r[x]+delta<bestans)
            {
                bestans = calcresult(a,b) + r[x]+delta;
                idx = i;
            }
            rotate_horizontal(x,-i);
        }
        if(idx!=0)
        {
            rotate_horizontal(x,idx);
            answers.push_back({'R',{x,idx}});
            ANS = bestans;
            delta+=r[x];
            successful++;
            return 1;
        }
    return 1;
}
bool rotatemaxcol()
{
    long long i,j;
    long long maxcol = 0,idx = -1,sum;
    for(j=1;j<=m;j++)
    {
        if(prohibc[j])continue;
        sum = 0;
        for(i=1;i<=n;i++)
        {
            sum+=a[i][j]*b[i][j];
        }
        if(sum>maxcol)
        {
            maxcol = sum;
            idx = j;
        }
    }
    if(idx==-1)return 0;
    prohibc[idx] = 1;
    long long x = idx;
     long long bestans = ANS;  idx = 0;
        for(i=1;i<n;i++)
        {
            rotate_vertical(x,i);
            if(calcresult(a,b)+c[x]+delta<bestans)
            {
                bestans = calcresult(a,b) + c[x]+delta;
                idx = i;
            }
            rotate_vertical(x,-i);
        }
        if(idx!=0)
        {
            rotate_vertical(x,idx);
            answers.push_back({'C',{x,idx}});
            ANS = bestans;
            delta+=c[x];
            successful++;
            return 1;
        }
    return 1;
}
long long average;
bool findmax()
{
    long long i,j;
    long long maxs = 0,idx = -1,idy;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            if(prohibc[j]||prohibr[i])continue;
            if(a[i][j]>maxs)
            {
                maxs = a[i][j];
                idx = i;
                idy = j;
            }
        }
    }
    long long mins = 1e9;
    long long tx=-1, ty;

     for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            if(prohibc[j]||prohibr[i])continue;
            if(b[i][j]<mins)
            {
                mins = b[i][j];
                tx = i;
                ty = j;
            }
        }
    }

    if(tx==-1||idx==-1)return 0;
    if(a[idx][idy]*average<a[idx][idy]*b[tx][ty]+r[idx]+c[ty])return 0;
    long long d = idy-ty;
    if(d<0)d+=m;
    if(d!=0)
    {
        rotate_horizontal(idx,d);
        answers.push_back({'R',{idx,d}});
        delta+=r[idx];
    }
    d = idx-tx;
    if(d<0)d+=n;
    if(d!=0)
    {
        rotate_vertical(ty,d);
        answers.push_back({'C',{ty,d}});
        delta+=c[ty];
    }
    return 1;
    prohibr[tx] = 1;
    prohibc[ty] = 1;
}
void findmax2()
{
    long long i,j;
    long long maxs = 0,idx = -1,idy;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            if(prohibc[j]||prohibr[i])continue;
            if(a[i][j]>maxs)
            {
                maxs = a[i][j];
                idx = i;
                idy = j;
            }
        }
    }
    long long mins = 1e9;
    long long tx=-1, ty;

     for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            if(prohibc[j]||prohibr[i])continue;
            if(b[i][j]<mins)
            {
                mins = b[i][j];
                tx = i;
                ty = j;
            }
        }
    }
   // cout<<idx<<" "<<idy<<" : "<<tx<<" "<<ty<<endl;
    if(tx==-1||idx==-1)return ;//cout<<"OKAY"<<endl;
    long long d = idy-ty;
    if(d<0)d+=m;

    if(d!=0)
    {
        rotate_horizontal(idx,d);
        answers.push_back({'R',{idx,d}});
        delta+=r[idx];
    }
    d = idx-tx;
    if(d<0)d+=n;
    if(d!=0)
    {
        rotate_vertical(ty,d);
        answers.push_back({'C',{ty,d}});
        delta+=c[ty];
    }
    prohibr[tx] = 1;
    prohibc[ty] = 1;
}
void calcaverage()
{
    long long i,j;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        average+=b[i][j];
    average = average/(n*m);
}
void copyresult()
{
    ANS2 = ANS;
    answers2.clear();
    long long i,j;
    for(i=0;i<answers.size();i++)
    {
        answers2.push_back(answers[i]);
    }
    answers.clear();
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        a[i][j] = z[i][j];
    ANS = calcresult(a,b);
}
int main()
{
    freopen ("movethematrix.out","w",stdout);
    freopen ("movethematrix.in","r",stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    read();
    calcaverage();
    long long i,j;
    long long br = 0;
    while(answers.size()<P&&lefttime(0.8))
    {
        if(!findmax())break;
    }ANS = calcresult(a,b)+delta;
    while(answers.size()<P&&lefttime(Time))
    {
         rotate();
        //cout<<float( clock () - begin_time ) /  CLOCKS_PER_SEC<<endl;
    }
    while(answers.size()<P-1&&lefttime(2.5))
    {
        if(br>=n/10)
        {
            br = 0;
            cases - 1-cases;
        }
        if(((cases==0) ? rotatemaxrow() : rotatemaxcol()) == 0)
        {cases = 1-cases; br = 0;}

    }

    copyresult(); //print();
    //cout<<ANS2<<endl;
    delta = 0;
    iterations = 0;
    cases = 0;
    successful = 0;
    memset(prohibc,0,sizeof(prohibc));
    memset(prohibr,0,sizeof(prohibr));
    br = 0;

    Time = 3.9;
    while(answers.size()<P&&lefttime(3.3))
    {
       // cout<<"OK"<<endl;
        findmax2();
    }ANS = calcresult(a,b)+delta;

    while(answers.size()<P&&lefttime(3.9))
    {
         rotate();
        //cout<<float( clock () - begin_time ) /  CLOCKS_PER_SEC<<endl;
    }
 // PRINT();
  //  cout<<ANS<<endl;
   // cout<<"*********"<<endl;

    while(answers.size()<P-1&&lefttime(4.0))
    {
        if(br>=n/10)
        {
            br = 0;
            cases - 1-cases;
        }
        if(((cases==0) ? rotatemaxrow() : rotatemaxcol()) == 0)
        {cases = 1-cases; br = 0;}

    }
   // PRINT();
  //  cout<<ANS<<endl;
    if(ANS<ANS2)
    {
      //  cout<<"REPLACE"<<endl;
        copyresult();
    }

        //cout<<"HERE"<<endl;
        print();
}