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

int n,x,y;
int a[maxn][maxn];

int main()  {
    int T;
    scanf("%d",&T);
    while (T--) {
        scanf("%d%d%d",&n,&x,&y);
        for (int i=1;i<=n;++i)
            for (int j=1;j<=n;++j)
                scanf("%d",&a[i][j]);
        
        int ans=1e9;
        for (int i=1;i<=n;++i)
            for (int j=1;j<=n;++j)  {
        // for (int i=9;i<=9;++i)
        //     for (int j=8;j<=8;++j)  {

                priority_queue<int> q;
                for (int dx=-3;dx<=3;++dx)
                    for (int dy=-3;dy<=3;++dy)  {
                        int x=i+dx,y=j+dy;
                        if (x<=0||x>n||y<=0||y>n) continue;
                        if (abs(x-i)+abs(y-j)>3) continue;
                        if (!dx&&!dy) continue;
                        q.push(a[x][y]);
                    }
                
                if (!q.size()) continue;

                // cout<<i<<" "<<j<<endl;
                int res=0;
                int k=a[i][j],b=0;
                for (int r=1;r<=8;++r)   {

                    
                    //k*t+b>=8*r*r;
                    int t=(8*r*r-b-1)/k+1;
                    // cout<<r<<":"<<k<<" "<<b<<" ~ "<<t<<endl;
                    b+=t*k;
                    res+=t;

                    if (q.size())   {
                        k+=q.top();
                        q.pop();
                    }
                }
                // cout<<i<<" "<<j<<":"<<res+(abs(i-x)+abs(j-y)+1)/2<<endl;
                ans=min(ans,res+(abs(i-x)+abs(j-y)+1)/2);
            }
        printf("%d\n",ans);
    }
    return 0;
}