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

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int n, k; cin >> n >> k; int A[n], B[n], i, j;
    int diff[n]; int cnt = 0; 
    for(i = 0; i < n; i++)  cin >> A[i];
    for(i = 0; i < n; i++) {
        cin >> B[i];
        if(A[i] >= B[i]) cnt++;
        diff[i] = A[i] - B[i];
    }
    long long sm = 0;
    string str(n, 'a');
    if(k > cnt) {
        priority_queue<pair<int, int>, vector<pair<int, int>>, 
            greater<pair<int, int>>> pq;
        for(i = 0; i < n; i++) {
            if(A[i] >= B[i])        str[i] = 'A';
            else if(B[i] > A[i])    pq.push({diff[i], i});
        }
        i = 0;
        while(i < n - k) {
            pair<int, int> pii = pq.top(); pq.pop();
            str[pii.second] = 'B';
            i++;
        }
        while(!pq.empty()) {
            pair<int, int> pii = pq.top(); pq.pop();
            str[pii.second] = 'A';
        }
    } else {
        priority_queue<pair<int, int>> pq;
        for(i = 0; i < n; i++) {
            if(B[i] >= A[i]) str[i] = 'B';
            else             pq.push({diff[i], i});
        }
        i = 0;
        while(i < k) {
            pair<int, int> pii = pq.top(); pq.pop();
            str[pii.second] = 'A';
            i++;
        }
        while(!pq.empty()) {
            pair<int, int> pii = pq.top(); pq.pop();
            str[pii.second] = 'B';
        }
    }
    cout << str;
    return 0;
}