#include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > > 
#define pii pair<int,int> 
#define pb push_back
#define mp make_pair
#define debuge cerr<<"isok"<<endl
#define debug(x) cerr<<#x<<"="<<x<<endl
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
#define SS second
#define FF first
#define ls (k<<1)
#define rs (k<<1|1)
#define clr(a,x) memset(a,x,sizeof(a))
#define cpy(a,x) memcpy(a,x,sizeof(a))
#define file(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define SZ(x) ((int)x.size())
#define timeck()  dprintf("Case #%d solved, time = %d ms\n",argv,(int)(clock()*1000/CLOCKS_PER_SEC))
using namespace std;
template<class T> inline void gmin(T &x,const T &y){x=x>y?y:x;}
template<class T> inline void gmax(T &x,const T &y){x=x<y?y:x;}
template<class T> inline bool Gmin(T &x,const T &y){return x>y?x=y,1:0;}
template<class T> inline bool Gmax(T &x,const T &y){return x<y?x=y,1:0;}
const int BufferSize=1<<16;
char buffer[BufferSize],*Bufferhead,*Buffertail;
bool Terminal;
inline char Getchar(){
	if(Bufferhead==Buffertail){
		int l=fread(buffer,1,BufferSize,stdin);
		if(!l){Terminal=1;return 0;}
		Buffertail=(Bufferhead=buffer)+l;
	}
	return *Bufferhead++;
}
template<class T>inline bool read(T &x){
	x=0;char c=Getchar(),rev=0;
	while(c<'0'||c>'9'){rev|=c=='-';c=Getchar();if(Terminal)return 0;}
	while(c>='0'&&c<='9') x=x*10+c-'0',c=Getchar();
	if(c=='.'){
		c=Getchar();double t=0.1;
		while(c>='0'&&c<='9') x=x+(c-'0')*t,c=Getchar(),t=t/10;
	}
	x=rev?-x:x;
	return 1;
}
template<class T1,class T2> inline bool read(T1 &x,T2 &y){return read(x)&read(y);}
template<class T1,class T2,class T3> inline bool read(T1 &x,T2 &y,T3 &z){return read(x)&read(y)&read(z);}
template<class T1,class T2,class T3,class T4> inline bool read(T1 &x,T2 &y,T3 &z,T4 &w){return read(x)&read(y)&read(z)&read(w);}
inline bool reads(char *x){
	char c=Getchar();
	while(c<33||c>126){c=Getchar();if(Terminal)return 0;}
	while(c>=33&&c<=126) (*x++)=c,c=Getchar();
	*x=0;return 1;
}
template<class T>inline void print(T x,const char c='\n'){
	if(!x){putchar('0');putchar(c);return;}
	if(x<0) putchar('-'),x=-x;
	int m=0,a[20];
	while(x) a[m++]=x%10,x/=10;
	while(m--) putchar(a[m]+'0');
	putchar(c);
}
//--------------------------------head---------------------------------------------

const int inf=0x3f3f3f3f;
const int N=200005,M=100005,mod=1e9+7;
template<class T,class S> inline void ch(T &x,const S y){x=(x+y)%mod;}
inline int exp(int x,int y,const int mod=::mod){
	int ans=1;
	while(y){
		if(y&1) ans=(ll)ans*x%mod;
		x=(ll)x*x%mod;y>>=1;
	}return ans;
}

int n,k,l,r,a,b;
char s[N];

inline void gen(int A,int B,int pos,int dir){
//	dprintf("%d %d %d %d\n",A,B,pos,dir);
	if(!dir){
		int L=pos,R=pos+A+B-1;
		ll mx=(ll)B*k;
		if(A<=k&&B<=k){
			int tl=L,tr=tl+A-1;
			for(int i=l;i<=r;i++)
				if(tl<=i&&i<=tr) s[i-l]='A';
			tl=tr+1,tr=tl+B-1;
			for(int i=l;i<=r;i++)
				if(tl<=i&&i<=tr) s[i-l]='B';
		}
		else if(A>=mx){
			int tl=L,tr=R;
			for(int i=l;i<=r;i++)
				if(tl<=i&&i<=tr){
					if((i-tl)%(k+1)!=k) s[i-l]='A'; else s[i-l]='B';
				}
		}
		else{
			int x=((ll)k*A+k-B-1)/(k*k-1);
			int tl=L,tr=tl+x*(k+1)-1;
			for(int i=l;i<=r;i++)
				if(tl<=i&&i<=tr){
					if((i-tl)%(k+1)!=k) s[i-l]='A'; else s[i-l]='B';
				}
			gen(B-x,A-k*x,R,1);
		}
	}
	else{
		int L=pos-A-B+1,R=pos;
		ll mx=(ll)B*k;
		if(A<=k&&B<=k){
			int tl=L,tr=tl+B-1;
			for(int i=l;i<=r;i++)
				if(tl<=i&&i<=tr) s[i-l]='A';
			tl=tr+1,tr=tl+A-1;
			for(int i=l;i<=r;i++)
				if(tl<=i&&i<=tr) s[i-l]='B';
		}
		else if(A>=mx){
			int tl=L,tr=R;
			for(int i=l;i<=r;i++)
				if(tl<=i&&i<=tr){
					if((tr-i)%(k+1)!=k) s[i-l]='B'; else s[i-l]='A';
				}
		}
		else{
			int x=((ll)k*A+k-B-1)/(k*k-1);
			int tr=R,tl=tr-x*(k+1)+1;
			for(int i=l;i<=r;i++)
				if(tl<=i&&i<=tr){
					if((tr-i)%(k+1)!=k) s[i-l]='B'; else s[i-l]='A';
				}
			gen(B-x,A-k*x,L,0);
		}
	}
}

int Main(int argv){
	scanf("%d%d%d%d",&a,&b,&l,&r);
	k=max((a+b)/(b+1),(b+a)/(a+1));
//	debug(k);
	if(a==b||a==b+1){
		for(int i=l;i<=r;i++)
			if(i&1) putchar('A'); else putchar('B');
		puts("");
		return 0;
	}
	if(a+1==b){
		for(int i=l;i<=r;i++)
			if(i&1) putchar('B'); else putchar('A');//utchar('A'+(i&1));
		puts("");
		return 0;
	}
	if(a>=b) gen(a,b,1,0); else gen(b,a,a+b,1);
	for(int i=l;i<=r;i++)
		putchar(s[i-l]);
	puts("");
	return 0;
}
void clear(){

}

int main(){
#ifdef rqgao2014
	freopen("input.txt","r",stdin);
#endif
	int T;scanf("%d",&T);
	for(int i=1;i<=T;i++)
		Main(i),clear();
	return 0;
}

Measured memory_bytes: 384