#include <bits/stdc++.h>
#define LL long long
#define PII pair<int,int>
#define mp make_pair
#define fi first
#define se second
using namespace std;
const int maxn = 510;
int food[maxn][maxn];
int need[10];
int n,x,y;


vector<int>Q;
void work(){
    int times = need[9] * 2;
    for (int i=1;i<=n;i++)
    for (int j=1;j<=n;j++){
//        cout<<"("<<i<<","<<j<<")"<<endl;
        Q.clear();
        for (int di = i-3;di<=i+3;di++)
        for (int dj = j-3;dj<=j+3;dj++){
            if (di < 1 || dj < 1 || di > n || dj > n) continue;
            if (abs(i-di) + abs(j-dj) > 3) continue;
            if (di == i && dj == j) continue;
            Q.push_back(-food[di][dj]);
        }
        sort(Q.begin(), Q.end());
//        for (int i=0;i<Q.size();i++) cout<<Q[i]<<" ";cout<<endl;
        int tmp = (abs(i - x) + abs(j - y) + 1 ) / 2;

        int pos = 0, sz = Q.size();
        int tot = 0, now = food[i][j];
//        cout<<"food[i][j] = "<<food[i][j]<<"\t";
//        cout<<"now = "<<now<<" ";
        for (int peo = 1; peo < 9; peo++){
            int day = (need[peo] - tot + now - 1) / now;
            if (day <= 0) continue;
            tot += now * day;
            tmp += day;
            if (pos < sz) now -= Q[pos++];
//            cout<<now<<" ";
        }
//        cout<<endl;
//        cout<<"tmp = "<<tmp<<endl;
        if (tmp < times) times = tmp;
    }
    printf("%d\n",times);
}
void vgeler(){
    int test;
    scanf("%d",&test);
    while (test--){
        scanf("%d%d%d",&n,&x,&y);
        for (int i=1;i<=n;i++)
            for (int j=1;j<=n;j++) scanf("%d",&food[i][j]);
        for (int i=1;i<=9;i++) need[i] = 8 * i * i;
//        for (int i=1;i<=9;i++) cout<<need[i]<<"\t"; cout<<endl;
        work();
    }
}
int main(){
    vgeler();
    return 0;
}