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

typedef long long ll;

int a[510][510];
int b[20];

int main() {
    int t;
    scanf("%d", &t);
    while(t--) {
        int n, x, y;
        scanf("%d%d%d", &n, &x, &y);

        int ans = 0x3f3f3f3f;
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                scanf("%d", &a[i][j]);

        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= n; j++) {
                int op = 0;
                for(int xx = -3; xx <= 3; xx++) {
                    for(int yy = -3; yy <= 3; yy++) {
                        if(abs(xx) + abs(yy) > 3) continue;
                        if(xx + i > n || xx + i < 1 || yy + j > n || yy + j < 1) continue;
                        if(xx == 0 && yy == 0) continue;
                        b[++op] = a[i+xx][j+yy];
                    }
                }
                sort(b + 1, b + 1 + op);
                int now = a[i][j], have = 0, d = op;
                int sum = (abs(i - x) + abs(j - y) + 1) / 2 ;
                for(int k = 1; k <= 8; k++) {
                    int need = 8 * k * k;
                    sum += (need - have + now - 1) / now;
                    have += (need - have + now - 1) / now * now;
                    if(d >= 1) {
                        now += b[d];
                        d--;
                    }
                }
                ans = min(ans, sum);
            }
        }
        cout << ans << endl;
    }
}