#include<bits/stdc++.h>
#define int long long
using namespace std;
const int M = 5e5 + 5;
int squ[M];

inline int find(int x) {
    return lower_bound(squ + 1, squ + M, x) - squ;
}

inline void Solve() {
    int a, b, A, B;
    cin >> a >> b >> A >> B;
    int ans_a(0), ans_b(0);
    int turn_a = find(a);
    int turn_b = find(b);
    int turn_ab = find(a + b);
    string s1, s2;

    // kill A firstly
    int rest = squ[turn_ab] - squ[turn_a];
    ans_a = turn_a * A + turn_ab * B;
    // cout<<turn_a<<" "<<turn_b<<" "<<rest<<endl;
    if (rest >= b) {
        string t1(turn_a, 'A'), t2(turn_ab - turn_a, 'B');
        s1 = t1 + t2;
    } else {
        // use (squ[turn_a] - a) to fuck b
        int ex = squ[turn_a] - a;
        string t1, t2;
        for (int i = 1; i < ex; i++) t1.push_back('A');
        t1.push_back('B');
        for (int i = ex + 1; i <= turn_a; i++) t1.push_back('A');
        for(int i = turn_a + 1; i <= turn_ab; i++) t2.push_back('B');
        s1 = t1 + t2;
    }

    // kill B firstly
    ans_b = turn_b * B + turn_ab * A;
    // if (rest < a) {
    // use (squ[turn_b] - b) to fuck a
    // try to move 'A's lefter 
    rest = squ[turn_b] - b;
    // cout << rest << endl;
    int sum = 0, len = 0;
    while(1) {
        sum += ++len;
        if (rest - sum <= len) {
            sum -= len--;
            break;
        }
    }
    // cout<<len<<endl;
    for (int i = 1; i <= len; i++) s2.push_back('A');
    for (int i = len + 1; i < rest - sum; i++) s2.push_back('B');
    if(rest - sum + 1 != 1)s2.push_back('A');
    for(int i = rest - sum + 1; i <= turn_b; i++) s2.push_back('B');
    for (int i = turn_b + 1; i <= turn_ab; i++) s2.push_back('A');
    // }
    if(ans_a < ans_b) {
        cout<<ans_a<<" "<<s1<<endl;
        return;
    } else if (ans_b < ans_a) {
        cout<<ans_b<<" "<<s2<<endl;
    } else {
        cout<<ans_a<<" "<<min(s1, s2)<<endl;
    }
}
signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int T; cin >> T;
    for (int i = 1; i < M; i++) squ[i] = squ[i - 1] + i;
    while(T--) Solve();
    return 0;   
}