#include<iostream>
#include<cstdlib>
#include<cstring>
#include<fstream>
#include<vector>
#include<ctime>
#include<queue>
#include<stack>

#define MAXN 405

using namespace std;

int n,o[MAXN],pos[MAXN],a[MAXN];

int t1,t2;
int p[MAXN][MAXN],q[MAXN][MAXN];

double t;

ifstream fin("sorting.in");
ofstream fout("sorting.out");

vector<vector<pair<int,int> > > v;


bool sorted ()
{
    for (int i=0; i<n; i++)
        if (a[i-1]>a[i])
            return false;
    return true;
}


void print(int pos)
{
    fout<<v[pos].size()<<'\n';

    for (int i=0; i<v[pos].size(); i++)
        fout<<v[pos][i].first+1<<' '<<v[pos][i].second+1<<'\n';

    fout.close();
}


void init()
{
    fin>>n;
    for (int i=0; i<n; i++)
        fin>>o[i];
    fin>>t1;
    for (int i=0; i<n; i++)
        for (int j=0; j<n; j++)
            fin>>p[i][j];
    fin>>t2;
    for (int i=0; i<n; i++)
        for (int j=0; j<n; j++)
            fin>>q[i][j];

    fin.close();
}


void initFunc ()
{
    for (int i=0; i<n; i++)
    {
        a[i]=o[i];
        pos[a[i]]=i;
    }
}


int sol1 () //n^2
{
    initFunc();

    int ans=0;
    for (int i=n; i>0; i--)
        if (pos[i]!=i-1)
        {
            v[1].push_back(make_pair(pos[i],i-1));
            int w1,w2;
            w1=a[i-1];
            w2=a[pos[i]];
            swap(a[i-1],a[pos[i]]);
            ans+=p[i-1][pos[i]]+q[a[i-1]-1][a[pos[i]]-1];
            pos[w1]=pos[i];
            pos[w2]=i-1;

//            for (int i=0; i<n; i++) ///fix this
//                pos[a[i]]=i;
        }

    return ans;
}


int sol2 () ///n^3
{
    initFunc();

    int ans=0;
    while(!sorted())
        for (int i=0; i<n; i++)
        {
            int temppos=i;
            for (int j=i+1; j<n; j++)
            {
                if (j+1>a[i])
                    break;

                if (a[j]<=temppos+1)
                {
                    swap(a[temppos],a[j]);
                    v[2].push_back(make_pair(temppos,j));
                    ans+=p[temppos][j]+q[a[temppos]-1][a[j]-1];
                    swap(pos[a[temppos]],pos[a[j]]);
                    if (temppos+1==a[j] || j+1==a[i])
                        break;
                    temppos=j;
                }
            }
        }

    return ans;
}


int checkMin (int *z, int m)
{
    int ans=(1<<31)-1,pos;

    for (int i=0; i<m; i++)
    {
        int cur=0;
        for (int j=0; j<m; j++)
        {
            if (i==j)
                continue;
            cur+=p[i][j];
        }
        if (cur<ans)
        {
            ans=cur;
            pos=i;
        }
    }

    return pos;
}


int sol3 () ///n^3
{
    initFunc();

    int ans=0,m;
    int z[405];
    for (int i=0; i<n; i++)
    {
        if (a[i]==i+1)
            continue;

        m=0;
        int pos=i;

        do
        {
            z[m]=pos;
            pos=a[pos]-1;
            m++;
        }while (pos!=i);

        int zero=checkMin(z,m);
        for (int j=zero+1; j<m; j++)
        {
            swap(a[z[zero]],a[z[j]]);
            v[3].push_back(make_pair(z[zero],z[j]));
            ans+=p[z[zero]][z[j]]+q[a[z[zero]]-1][a[z[j]]-1];
        }

        for (int j=0; j<zero; j++)
        {
            swap(a[z[zero]],a[z[j]]);
            v[3].push_back(make_pair(z[zero],z[j]));
            ans+=p[z[zero]][z[j]]+q[a[z[zero]]-1][a[z[j]]-1];
        }
    }

    return ans;
}


int sol4 () //n^2
{
    initFunc();

    int ans=0;
    while (true)
    {
        int z=-1,pr=(1<<31)-1;
        for (int i=0; i<n; i++)
        {
            if (pos[i+1]==i)
                continue;
            int temp=p[i][pos[i+1]]+q[a[i]-1][a[pos[i+1]]-1];
            if (temp<pr)
            {
                pr=temp;
                z=i;
            }
        }
        if (z==-1)
            break;
        int o1=a[z],o2=a[pos[z+1]],o3=pos[z+1];
        swap(a[z],a[pos[z+1]]);
        v[4].push_back(make_pair(z,pos[z+1]));
        swap(pos[a[z]],pos[a[pos[z+1]]]);
        ans+=pr;
    }
    return ans;
}


int solve (int *a, int pos0, int pos, int l)
{
    int d[MAXN],pred[MAXN];
    priority_queue<pair<int,int> > pq;

    for (int i=0; i<=n; i++)
    {
        d[i]=99999999;
        pred[i]=-1;
    }

    pq.push(make_pair(0,pos0));
    d[pos0]=0;

    while (!pq.empty())
    {
        if ((clock()-t)/CLOCKS_PER_SEC>=2.7)
            return 0;
        int num,w;
        num=pq.top().second;
        w=-pq.top().first;
        pq.pop();
        if (w>d[num])
            continue;

        for (int i=0; i<n; i++)
        {
            if (w+p[i][num]+q[a[pos0]-1][a[num]-1]<d[i] && a[i]!=i+1)
            {
                d[i]=w+p[i][num]+q[a[pos0]-1][a[num]-1];
                pred[i]=num;
                pq.push(make_pair(-d[i],i));
            }
        }
    }

    stack<int> s;
    int z=pos;
    s.push(z);
    while (pred[z]!=-1)
    {
        s.push(pred[z]);
        z=pred[z];
    }

    int ans=0,tekpos=s.top();
    s.pop();
    while (!s.empty())
    {
        ans+=p[tekpos][s.top()]+q[a[tekpos]-1][a[s.top()]-1];
        swap(a[tekpos],a[s.top()]);
        v[l].push_back(make_pair(tekpos,s.top()));
        tekpos=s.top();
        s.pop();
    }

    return ans;
}


int sol5 () ///n^3
{
    for (int i=0; i<n; i++)
        a[i]=o[i];

    int ans=0;
    for (int ii=1; ii<=n; ii++)
    {
        for (int j=0; j<n; j++)
            pos[a[j]]=j;
        int i=pos[ii];

        if (a[i]==i+1)
            continue;

        ans+=solve(a,i,a[i]-1,5);
    }

    return ans;
}


int sol6 () ///n^3
{
    for (int i=0; i<n; i++)
        a[i]=o[i];

    int ans=0;
    for (int ii=n; ii>0; ii--)
    {
        for (int j=0; j<n; j++)
            pos[a[j]]=j;
        int i=pos[ii];

        if (a[i]==i+1)
            continue;

        ans+=solve(a,i,a[i]-1,6);
    }

    return ans;
}

int sol7 (int l)
{
    int ans=0;

    initFunc();

    vector<int> q;
    for (int i=1; i<=n; i++)
        if (pos[i]!=i-1)
            q.push_back(i);

    //cout<<"passed from here\n";

    while (!q.empty())
    {
        if ((clock()-t)/CLOCKS_PER_SEC>=2.7)
            return -1;
//        for (int j=0; j<q.size(); j++)
//            cout<<q[j]<<' ';
//        cout<<'\n';
//        for (int j=0; j<n; j++)
//            cout<<a[j]<<' ';
//        cout<<'\n';

        int ii=rand()%q.size(),i;
//        cout<<ii<<' '<<q[ii]<<"\n\n";
        i=pos[q[ii]];
        q.erase(q.begin()+ii);
        if (a[i]==i+1)
            continue;

        ans+=solve(a,i,a[i]-1,l);
        if ((clock()-t)/CLOCKS_PER_SEC>=2.7)
            return -1;
        for (int j=0; j<n; j++)
            pos[a[j]]=j;
    }

    return ans;
}

int main()
{
    v.resize(100000); ///
    srand(time(NULL));
    t=clock();
    init();
    if ((t1==4 && t2==0) || (t1==4 && t2==4))
    {
        sol1();
        print(1);
        return 0;
    }

    if (t1==2 && t2==0)
    {
        sol2();
        print(2);
        return 0;
    }

    else
    {
        vector<int> ans;
        ans.push_back(sol1());
        //cout<<"passed "<<1<<'\n';
        ans.push_back(sol2());
        //cout<<"passed "<<2<<'\n';
        ans.push_back(sol3());
        //cout<<"passed "<<3<<'\n';
        ans.push_back(sol4());
        //cout<<"passed "<<4<<'\n';
        if ((clock()-t)/CLOCKS_PER_SEC>=2.7)
            ans.push_back((1<<31)-1);
        else
            ans.push_back(sol5());
        //cout<<"passed "<<5<<'\n';
        if ((clock()-t)/CLOCKS_PER_SEC>=2.7)
            ans.push_back((1<<31)-1);
        else
            ans.push_back(sol6());

        int l=7;

        while (l<100000)
        {
            ans.push_back(sol7(l));
            l++;
            if (ans[ans.size()-1]==-1)
            {
                l--;
                break;
            }
        }

        int minAns=(1<<31)-1,minI;
        for (int i=0; i<l-1; i++)
            if (ans[i]<minAns)
            {
                minAns=ans[i];
                minI=i;
            }

        print(minI+1);
    }
}