#include <bits/stdc++.h>

#define llong long long

#define pb push_back
#define mp make_pair

const int INF = (int) 1e9 + 7;
const int MXN = (int) 1e2 + 7;

using namespace std;

const int dx[] = {1, -1, 2, -2, 1, -1, 2, -2};
const int dy[] = {2, -2, 1, -1, -2, 2, -1, 1};

int t, n, m, cnt;
int u[MXN][MXN];

bool dfs(int x, int y, int c = 1) {
    u[x][y] = true;
    bool boo = false;
    cout << x << ' ' << y << "\n";
    if (c == n * m) return true;
    for (int i = 0; i < 8; i++) {
        int nx = x + dx[i];
        int ny = y + dy[i];
        if (nx >= 1 && nx <= n && ny > 0 && ny <= m && !u[nx][ny])
            boo |= dfs(nx, ny, c + 1);
    }
    u[x][y] = false;
    return boo;
}

int main() {
    #ifndef LOCAL

    #define FN "binary"
    freopen(FN".in", "r", stdin);
    freopen(FN".out", "w", stdout);

    #endif // LOCAL

    scanf("%d", &t);
    for (int cases = 1; cases <= t; cases++) {
        scanf("%d%d", &n, &m);
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++)
                if (dfs(i, j)) printf("%c%d", char(i + 'A' - 1), j);
    }
    return 0;
}
//[(][([([[)])]([(][](]
//[(][([(([[)])