#include<bits/stdc++.h>
using namespace std;
int a[505][505],p[105];
int main(){
    int T=10; scanf("%d",&T);
    while (T--){
        int n=500, sx=rand()%n+1, sy=rand()%n+1;
        scanf("%d%d%d",&n,&sx,&sy);
        for (int i=1;i<=n;i++)
            for (int j=1;j<=n;j++)
                a[i][j]=1,scanf("%d",&a[i][j]);
        int ans=1e9;
        for (int i=1;i<=n;i++)
            for (int j=1;j<=n;j++){
                int step=abs(i-sx)+abs(j-sy);
                step=(step+1)/2;
                *p=0;
                for (int x=-3;x<=3;x++)
                    for (int y=-3;y<=3;y++)
                        if (abs(x)+abs(y)<=3&&i+x>=1&&i+x<=n&&j+y>=1&&j+y<=n)
                            if (x!=0||y!=0)
                                p[++*p]=a[i+x][j+y];
                sort(p+1,p+*p+1);
                reverse(p+1,p+*p+1);
                int cnt=0;
                int people=1,food=0,occpy=a[i][j];
                while (people<9){
                    int needadd = (8*people*people-food+occpy-1)/occpy;
                    step+=needadd;
                    food+=needadd*occpy;
                    assert(food>=8*people*people);
                    if (food>=8*people*people){
                        if (cnt<p[0])
                            occpy+=p[++cnt];
                        people++;
                    }
                }
                //printf("%d %d %d\n",i,j,step);
                ans=min(ans,step);
            }
        printf("%d\n",ans);
    }
}