#include<bits/stdc++.h>
#define D(...) fprintf(stderr,__VA_ARGS__)
#define int long long
#define LL long long
#define MP make_pair
#define PB push_back
#define fi first
#define se second
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef pair<int,int>PII;typedef vector<int>VI;typedef vector<PII>VII;
template<typename T>void rd(T&x){int f=0,c;while(!isdigit(c=getchar()))f^=!(c^45);x=(c&15);while(isdigit(c=getchar()))x=x*10+(c&15);if(f)x=-x;}
template<typename T>void pt(T x,int c=-1){if(x<0)putchar('-'),x=-x;if(x>9)pt(x/10);putchar(x%10+48);if(c!=-1)putchar(c);}

const int N=505;

queue<PII>q;
int a[N][N],dis[N][N];
int T,n,x,y,ans;

signed main(){
    rd(T);
    while(T--){
        memset(dis,-1,sizeof(dis));
        rd(n);rd(x);rd(y);ans='x'+'a'+'y'+'l'+'o'+'v'+'e'+'c'+'z'+'z'+13141314;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++)rd(a[i][j]);
        }
        dis[x][y]=0;q.push(MP(x,y));
        while(!q.empty()){
            PII u=q.front();q.pop();
            for(int i=-2;i<=2;i++){
                for(int j=-2;j<=2;j++){
                    int x=u.first+i,y=u.second+j;
//                    cout<<x<<" "<<y<<endl;
                    if(abs(i)+abs(j)<=2&&x>=1&&x<=n&&y>=1&&y<=n&&dis[x][y]==-1){
                        dis[x][y]=dis[u.first][u.second]+1;
                        q.push(MP(x,y));
                    }
                }
            }
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                vector<int>now;
                for(int dx=-3;dx<=3;dx++){
                    for(int dy=-3;dy<=3;dy++){
                        int x=i+dx,y=j+dy;
                        if(x>=1&&x<=n&&y>=1&&y<=n&&(dx||dy)){
                            now.push_back(a[x][y]);
                        }
                    }
                }
                sort(ALL(now));reverse(ALL(now));
                int cnt=1,sum=0,v=a[i][j],res=dis[i][j];
                while(cnt<9){
                    int r=(8*cnt*cnt-sum+v-1)/v;
                    sum+=r*v;res+=r;++cnt;
                    if(cnt-2<now.size())v+=now[cnt-2];
                }
                ans=min(ans,res);
            }
        }
        pt(ans,'\n');
    }
    return 0;
}