#include <bits/stdc++.h>
using namespace std;

const int N=406;
int b[N];
int c1[N][N],c2[N][N];
int myrand(int s,int e){
    return rand()%(e-s+1)+s;
}
int main()
{
    ios_base::sync_with_stdio(false);
    freopen("sorting.in","r",stdin);
    freopen("sorting.out","w",stdout);
    srand(time(NULL));
    int n;
    cin>>n;
    vector<int> a,c;
    for (int i=0;i<n;i++){
        int dd;
        cin>>dd;
        c.push_back(dd);
        b[i]=n-i;
    }
    int t;
    cin>>t;
    for (int i=0;i<n;i++){
        for (int j=0;j<n;j++){
            cin>>c1[i][j];
        }
    }
    cin>>t;
    for (int i=1;i<=n;i++){
        for (int j=1;j<=n;j++){
            cin>>c2[i][j];
        }
    }
    int mnans=INT_MAX;
    vector<pair<int,int> > v;
    vector<pair<int,int> > k;
    for (int ss=0;ss<400;ss++){
        a=c;
        int ans=0;
        for (int i=0;i<n;i++){
            int fnd=b[i];
            for (int i=0;i<n;i++){
                if (a[i]==fnd){
                    if (i==a[i]-1)break;
                    ans+=c1[i][a[i]-1]+c2[a[i]][a[a[i]-1]];
                    v.push_back({i+1,a[i]});
                    swap(a[i],a[a[i]-1]);
                    break;
                }
            }
        }
        if (ans<mnans){
            mnans=ans;
            k=v;
            //cout<<k.size()<<endl;
        }
        //cout<<ans<<endl;
        v.clear();
        random_shuffle(b,b+n);
    }
    int ans=0;
    a=c;
    for (int j=0;j<n;j++){
        vector<int> g;
        for (int i=0;i<n;i++){
            if (i==a[i]-1)continue;
            g.push_back(c1[i][a[i]-1]+c2[a[i]][a[a[i]-1]]);
            //cout<<mn<<" "<<i+1<<" "<<a[i]<<endl;
        }
        if (g.size()==0)break;
        sort(g.begin(),g.end());
        int mn=g[myrand(0,min(2,(int)g.size()-1))];
        for (int i=0;i<n;i++){
            if (i==a[i]-1)continue;
            if (c1[i][a[i]-1]+c2[a[i]][a[a[i]-1]]==mn){
                ans+=c1[i][a[i]-1]+c2[a[i]][a[a[i]-1]];
                v.push_back({i+1,a[i]});
                swap(a[i],a[a[i]-1]);
                break;
            }
        }
    }
    if (ans<mnans){
        mnans=ans;
        k=v;
    }
    v.clear();
    ans=0;
    a=c;
    for (int j=0;j<n;j++){
        int mn=INT_MAX;
        for (int i=0;i<n;i++){
            if (i==a[i]-1)continue;
            mn=min(mn,c1[i][a[i]-1]+c2[a[i]][a[a[i]-1]]);
            //cout<<mn<<" "<<i+1<<" "<<a[i]<<endl;
        }
        for (int i=0;i<n;i++){
            if (i==a[i]-1)continue;
            if (c1[i][a[i]-1]+c2[a[i]][a[a[i]-1]]==mn){
                ans+=c1[i][a[i]-1]+c2[a[i]][a[a[i]-1]];
                v.push_back({i+1,a[i]});
                swap(a[i],a[a[i]-1]);
                break;
            }
        }
    }
    if (ans<mnans){
        mnans=ans;
        k=v;
    }
    cout<<k.size()<<endl;
    for (int i=0;i<k.size();i++){
        cout<<k[i].first<<" "<<k[i].second<<endl;
    }
    return 0;
}