#include <iostream>
#include <vector>
#include <cstdio>
#include <utility>

using namespace std;

typedef long long ll;

ll a[502][502], b[502][502], c[502][502],p;
int n,m;
vector<ll> rows,cols,rowIdx;
vector<pair<char,pair<ll,ll> > > ans;
ll rowsSum=0, colsSum=0;

int main()
{
    freopen("movethematrix.in","r",stdin);
    freopen("movethematrix.out","w",stdout);
    ios_base::sync_with_stdio(0);
    cin>>m>>n>>p;
    for(int i=0;i<m;i++)
    {
        ll in;
        cin>>in;
        rows.push_back(in);
        rowsSum+=in;
    }
    for(int i=0;i<n;i++)
    {
        ll in;
        cin>>in;
        cols.push_back(in);
        colsSum+=in;
    }
    for(int i=0;i<m;i++)
        for(int j=0;j<n;j++)
            cin>>a[i][j];
    for(int i=0;i<m;i++)
        for(int j=0;j<n;j++)
            cin>>b[i][j];

    ll best=0,rowShift=0;
    for(int i=0;i<m;i++)
        for(int j=0;j<n;j++)
            best+=a[i][j]*b[i][j];
    for(int shift=1;shift<n;shift++)
    {
       ll curr=0;
       for(int i=0;i<min((int)p,m);i++)
            for(int j=0;j<n;j++)
                curr+=a[i][(shift+j)%n]*b[i][j];
       if(curr+rowsSum<best)
       {
           best=curr+rowsSum;
           rowShift=shift;
       }
    }
    if(rowShift!=0)
    {
        cout<<min((int)p,m)<<"\n";
        for(int i=0;i<min((int)p,m);i++)
            cout<<'R'<<" "<<i+1<<" "<<rowShift<<"\n";
        return 0;
    }
    for(int i=0;i<m;i++)
    {
        ll curr=0;
        int saveShift=0;
        for(int j=0;j<n;j++)
            curr+=a[i][j]*b[i][j];
        for(int shift=1;shift<=p && shift<min(500,n);shift++)
        {
            int aidx=shift, bidx=0;
            ll sum=0LL;
            while(bidx<n)
            {
                sum+=a[i][aidx++]*b[i][bidx++];
                if(aidx==n)
                    aidx=0;
                if(sum>curr) break;
            }
            if(sum+shift*rows[i]<curr)
            {
                curr=sum+shift*rows[i];
                saveShift=shift;
            }
        }
        if(saveShift<=p && saveShift!=0)
        {
            p-=saveShift;
            ans.push_back({'R',{i+1,saveShift}});
            int idx=0;
            ll val=a[i][0];
        }
        rowIdx.push_back(saveShift);
    }
    for(int j=0;j<n;j++)
    {
        ll curr=0;
        int saveShift=0;
        for(int i=0;i<m;i++)
            curr+=a[i][(j+rowIdx[i])%n]*b[i][j];
        for(int shift=1;shift<=p && shift<min(500,m);shift++)
        {
            int aidx=shift, bidx=0;
            ll sum=0LL;
            while(bidx<m)
            {
                sum+=a[aidx][(j+rowIdx[aidx])%n]*b[bidx++][j];
                aidx++;
                if(aidx==m)
                    aidx=0;
                if(sum>curr) break;
            }
            if(sum+shift*cols[j]<curr)
            {
                curr=sum+shift*cols[j];
                saveShift=shift;
            }
        }
        if(saveShift<=p && saveShift!=0)
        {
            p-=saveShift;
            ans.push_back({'C',{j+1,saveShift}});
        }
    }
    cout<<ans.size()<<"\n";
    for(auto i : ans)
        cout<<i.first<<" "<<i.second.first<<" "<<i.second.second<<"\n";
    return 0;
}