#include <bits/stdc++.h>
using namespace std;
const int N = 505;
int n, x, y;
int a[N][N];
inline int inside(int x) {
    return 1 <= x && x <= n;
}
void solve() {
    scanf("%d %d %d", &n, &x, &y);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            scanf("%d", &a[i][j]);
    int ans = 1E9;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) {
            int c = (abs(i - x) + abs(j - y) + 1) / 2;
            vector <int> f;
            for (int d1 = -3; d1 <= 3; d1++)
                for (int d2 = -3; d2 <= 3; d2++)
                    if (abs(d1) + abs(d2) <= 3 && inside(i + d1) && inside(j + d2)) {
                        if (d1 || d2) f.push_back(a[i + d1][j + d2]);
                    }
            sort(f.begin(), f.end());
            f.push_back(a[i][j]);
            reverse(f.begin(), f.end());
            for (int i = 0; i < 9; i++) f.push_back(0);
            int cnt = 1, sum = f[0], tot = 0;
            while (cnt < 9) {
                tot += sum;
                if (tot >= 8 * cnt * cnt) sum += f[cnt], cnt++;
                if (cnt == 9) break;
                c++;
            }
            ans = min(ans, c + 1);
        }
    printf("%d\n", ans);
}
int main() {
    int T;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}