#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;


    while (t--) {
        ll n, k;
        cin >> n >> k;
        if (k == 1 || 2LL * n * (n - 1) - k == 1) {
            cout << "Impossible\n";
            continue;
        }
        vector<vector<int>> block(n, vector<int>(n));
        vector<pair<ll, pii>> op;
        int cnt3 = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if ((i + j) % 2 == 0) {
                    block[i][j] = 1;
                    int cnt = 4;
                    if (i == 0 || i == n - 1)cnt--;
                    if (j == 0 || j == n - 1)cnt--;
                    op.push_back({cnt, {i, j}});
                    cnt3 += (cnt == 3);
                }
            }
        }
        sort(op.begin(), op.end());
        reverse(op.begin(), op.end());
        ll num = 2LL * n * (n - 1) - k;
        for (auto [cnt, pos]: op) {
            if (num - cnt != 1 && num >= cnt) {
                if (cnt == 3) {
                    cnt3--;
                    if (cnt3 == 0 && (num - cnt) % 2 == 1)continue;
                }
                num -= cnt;
                block[pos.first][pos.second] = 0;
            }
        }
        assert(num == 0);
        cout << "Possible\n";
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                cout << (block[i][j] ? 'R' : 'B');
            }
            cout << "\n";
        }

    }
    return 0;
}