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

int T, n, sx, sy, a[555][555], ans=1e9;

int cnt[5];

int main(){
    for (cin>>T;T--;){
        cin>>n>>sx>>sy;
        for (int i=1;i<=n;++i)
            for (int j=1;j<=n;++j)
                scanf("%d",&a[i][j]);
        ans=1e9;
        for (int i=1;i<=n;++i)
            for (int j=1;j<=n;++j){
                memset(cnt,0,sizeof cnt);
                for (int ii=-3;ii<=3;++ii)
                    for (int jj=-3;jj<=3;++jj)
                        if (abs(ii)+abs(jj)<=3&&i+ii>=1&&i+ii<=n&&j+jj>=1&&j+jj<=n){
                            ++cnt[a[i+ii][j+jj]];
                        }
                int dis=abs(sx-i)+abs(sy-j), bas=(dis? (dis+1)/2: 1);
                if (dis==0) bas=0;
                int res=0, now=a[i][j], t=0;
                --cnt[a[i][j]];
                // if (i==1&&j==1) for (int k=1;k<=3;++k) printf(" %d %d\n",k,cnt[k]);
                for (int k=1;k<9;++k){
                    int aim=8*k*k;
                    if (t<aim){
                        int d=(aim-t+now-1)/now;
                        res+=d; t+=d*now;
                    }
                    //t-=aim;
                    for (int l=3;l>=1;--l)
                        if (cnt[l]){
                            --cnt[l]; now+=l; break;
                        }
                    //if (i==1&&j==1) printf(" %d %d %d %d\n",k,res,now,t);
                }
                ans=min(ans,res+bas);
            }
        cout<<ans<<endl;
    }
}