#include<bits/stdc++.h>
#define ls ch[x][0]
#define rs ch[x][1]
#define ll long long
using namespace std;
typedef pair<int,int> PII ;

inline ll read(){
    ll num=0,neg=1;char c=getchar();
    while(!isdigit(c)){if(c=='-')neg=-1;c=getchar();}
    while(isdigit(c)){num=(num<<3)+(num<<1)+c-'0';c=getchar();}
    return num*neg;
}

int line[110],a[510][510],n,T;


inline int solve(int x,int y){
    int cnt=0;
    for(int i=x-3;i<=x+3;i++)
        for(int j=y-3;j<=y+3;j++){
            if(i>n||i<1||j>n||j<1||(i==x&&y==j))continue;
            if(abs(x-i)+abs(y-j)<=3) line[++cnt]=a[i][j];
        }
    sort(line+1,line+cnt+1);
    int ans=0,food=0,pp=1,add=a[x][y];
    for(int p=2;p<=9;p++){
        int tmp=((p-1)*(p-1)*8-food+add-1)/add;
        ans+=tmp;food+=tmp*add;
        if(cnt)add+=line[cnt--];
    }return ans;
}

int main(){
    T=read();
    while(T--)
    {
        n=read();
        int x=read(),y=read();
        for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        a[i][j]=read();
        int res=1e9;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++)
                res=min(res,(abs(i-x)+abs(j-y)+1)/2+solve(i,j));
        }
        printf("%d\n",res);
    }return 0;
}