#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cctype>
#include <cmath>
#include <stack>
#include <sstream>
#include <list>
#include <assert.h>
#include <bitset>
#include <numeric>
#define debug() puts("++++")
#define print(x) cout<<(x)<<endl
// #define gcd(a, b) __gcd(a, b)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define fi first
#define se second
#define pb push_back
#define sqr(x) ((x)*(x))
#define ms(a,b) memset(a, b, sizeof a)
#define sz size()
#define be begin()
#define ed end()
#define pu push_up
#define pd push_down
#define cl clear()
#define lowbit(x) -x&x
#define all 1,n,1
#define FOR(i,n,x)  for(int i = (x); i < (n); ++i)
#define freopenr freopen("in.in", "r", stdin)
#define freopenw freopen("out.out", "w", stdout)
using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const LL LNF = 1e17;
const double inf = 1e20;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int maxn = 500 + 7;
const int maxm = 2000000 + 7;
const LL mod = 1e9 + 7;
const int dr[] = {-1, 1, 0, 0, 1, 1, -1, -1};
const int dc[] = {0, 0, 1, -1, 1, -1, 1, -1};
int n, m;

inline bool is_in(int r, int c) {
  return r >= 0 && r < n && c >= 0 && c < m;
}
inline int readInt(){
  int x;  cin >> x;  return x;
}

inline int gcd(int a, int b){
  return b == 0 ? a : gcd(b, a%b);  
}


int a[maxn][maxn];
bool vis[maxn][maxn];

std::vector<int> out;

struct Pos{
  int x, y, dist;
};

void bfs(int r, int c){
  queue<Pos> q;
  q.push((Pos){r, c, 0});

  while(!q.empty()){
    Pos p = q.front();  q.pop();
    if(p.dist > 3)  continue;
    if(p.dist != 0)
      out.pb(a[p.x][p.y]);
    if(p.dist == 3)  continue;
    for(int i = 0; i < 4; ++i){
      int x = p.x + dr[i];
      int y = p.y + dc[i];
      if(!is_in(x, y) || vis[x][y])  continue;
      vis[x][y] = 1;
      q.push((Pos){x, y, p.dist + 1});
    }
  }
}

void dfs(int r, int c, int sum){
  if(sum > 3)  return;
  for(int i = 0; i < 4; ++i){
    int x = r + dr[i];
    int y = c + dc[i];
    if(!is_in(x, y) || vis[x][y])  continue;
    vis[x][y] = 1;
    out.pb(a[x][y]);
    dfs(x, y, sum + 1);
  }
}

void dfs(int r, int c){
  for(int i = 0; i < 4; ++i){
    int x = r + dr[i];
    int y = c + dc[i];
    if(!is_in(x, y) || !vis[x][y])  continue;
    vis[x][y] = 0;
    dfs(x, y);
  }
}

inline bool is_full(int food, int i){
  return food >= 8 * sqr(i);
}

int solve(int r, int c){
  int food = 0, num = 1;
  out.cl;  vis[r][c] = 1;
  bfs(r, c);
  sort(out.be, out.ed, greater<int>());
  int index = 0;
  int sum = a[r][c];
  int ans = 0;
  while(num < 9){
    food += sum;
    ++ans;
    if(is_full(food, num)){
      ++num;
      if(index < out.sz)  sum += out[index++];
    }
  }

  vis[r][c] = 0;
  dfs(r, c);
  // for(int i = 0; i < n; ++i)
  //   for(int j = 0; j < n; ++j)
  //     if(vis[i][j])  int x = 10 / 0;
  return ans;
}


int main(){
  int T;  scanf("%d", &T);  
  while(T--){
    int x, y;
    scanf("%d %d %d", &n, &x, &y);
    m = n;  --x, --y;
    for(int i = 0; i < n; ++i)
      for(int j = 0; j < n; ++j)
        scanf("%d", a[i] + j);
    int ans = INF;
    for(int i = 0; i < n; ++i)
      for(int j = 0; j < n; ++j){
        int dist = abs(i-x) + abs(j-y);
        int res = solve(i, j) + dist / 2 + (dist % 2 != 0);
        ans = min(res, ans);
      }
      printf("%d\n", ans);

  }
  return 0;
}