#include<iostream>
#include<fstream>
#include<vector>
#include<random>
#include<algorithm>

using namespace std;

const int MAXN = 405;

mt19937 randomGenerator(69420);

int n;
int a[MAXN];

int typeIndex, typeValue;
int costIndex[MAXN][MAXN], costValue[MAXN][MAXN];

int aCopy[MAXN];
vector <int> assistance;

vector < pair <int, int> > answer, help;

void gen(int index, int i, int j)
{
    if(index==n+1) return;
    if(index==i || index==j)
    {
        gen(index+1, i, j);
        return;
    }

    if(randomGenerator()%100<10) assistance.push_back(index);
    gen(index+1, i, j);
}

vector < pair <int, int> > optimize(int I, int J)
{
    int lastIndex = -1;

    int minValue = 0, currentValue;
    vector < pair <int, int> > answer, current;

    answer.push_back({I, J});
    minValue = costIndex[I][J] + costValue[ a[I] ][ a[J] ];

    for(int roll = 0;roll<15;roll++)
    {
        assistance.clear();

        gen(1, I, J);
        random_shuffle(assistance.begin(), assistance.end());

        /*
        cout << "assistance: ";
        for(int i = 0;i<assistance.size();i++)
            cout << assistance[i] << " ";
        cout << '\n';
        */

        for(int k = 0;k<=assistance.size();k++)
        {
            current.clear();
            currentValue = 0;
            for(int i = 1;i<=n;i++)
            {
                aCopy[i] = a[i];
            }

            lastIndex = I;
            for(int i = 0;i<k;i++)
            {
                currentValue += costIndex[lastIndex][ assistance[i] ] + costValue[ a[lastIndex] ][ a[ assistance[i] ] ];
                current.push_back({lastIndex, assistance[i]});

                lastIndex = assistance[i];
            }

            lastIndex = J;
            for(int i = assistance.size()-1;i>=k;i--)
            {
                currentValue += costIndex[lastIndex][ assistance[i] ] + costValue[ a[lastIndex] ][ a[ assistance[i] ] ];
                current.push_back({lastIndex, assistance[i]});

                lastIndex = assistance[i];
            }

            int index1 = I;
            if(k>0) index1 = assistance[k - 1];

            int index2 = J;
            if(k<assistance.size()) index2 = assistance[k];

            currentValue += costIndex[index1][index2] + costValue[ a[index1] ][ a[index2] ];
            current.push_back({index1, index2});

            lastIndex = index1;
            for(int i = k-2;i>=0;i--)
            {
                currentValue += costIndex[lastIndex][ assistance[i] ] + costValue[ a[lastIndex] ][ a[ assistance[i] ] ];
                current.push_back({lastIndex, assistance[i]});

                lastIndex = assistance[i];
            }

            currentValue += costIndex[lastIndex][ I ] + costValue[ a[lastIndex] ][ a[ I ] ];
            current.push_back({lastIndex, I});

            lastIndex = index2;
            for(int i = k+1;i<assistance.size();i++)
            {
                currentValue += costIndex[lastIndex][ assistance[i] ] + costValue[ a[lastIndex] ][ a[ assistance[i] ] ];
                current.push_back({lastIndex, assistance[i]});

                lastIndex = assistance[i];
            }

            currentValue += costIndex[lastIndex][ J ] + costValue[ a[lastIndex] ][ a[ J ] ];
            current.push_back({lastIndex, J});

            if(currentValue<minValue)
            {
                //cout << currentValue << " vs " << minValue << '\n';

                minValue = currentValue;
                answer = current;
            }
        }
    }

    return answer;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    ifstream cin("sorting.in");
    ofstream cout("sorting.out");

    int minValue, index;

    cin >> n;
    for(int i = 1;i<=n;i++)
    {
        cin >> a[i];
    }

    cin >> typeIndex;
    for(int i = 1;i<=n;i++)
    {
        for(int j = 1;j<=n;j++)
        {
            cin >> costIndex[i][j];
        }
    }

    cin >> typeValue;
    for(int i = 1;i<=n;i++)
    {
        for(int j = 1;j<=n;j++)
        {
            cin >> costValue[i][j];
        }
    }

    for(int i = 1;i<=n;i++)
    {
        index = i;
        minValue = a[i];
        for(int j = i+1;j<=n;j++)
        {
            if(a[j]<minValue)
            {
                minValue = a[j];
                index = j;
            }
        }

        swap(a[i], a[index]);
        if(i!=index)
        {
            //cout << i << " -- " << index << '\n';

            help = optimize(i, index);
            for(int j = 0;j<help.size();j++)
            {
                answer.push_back(help[j]);
                //cout << help[j].first << " " << help[j].second << '\n';
            }

        }
    }

    cout << answer.size() << '\n';
    for(int i = 0;i<answer.size();i++)
    {
        cout << answer[i].first << " " << answer[i].second << '\n';
    }
}