for _ in [0]*int(input()):
s=input();a=b=0;ans='YES'
for i in s:
a+=(i=='A');b+=(i=='B')
if a<b:ans='NO';break
print(ans if s[-1]=='B' else 'NO')#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
const int N=2e5+10;
#define INF 0x3f3f3f3f;
typedef long long int ll;
#define close(); std::ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);
//----------------------------------------------------------------------------//
void solve()
{
string s1;
cin>>s1;
bool have_b=false;
bool ok=true;
int num_a=0;
int num_b=0;
for(int i=0;i<s1.size();i++)
{
if(s1[i]=='A') num_a++;
if(s1[i]=='B')
{
have_b=true,num_b++;
if(num_a>=num_b) continue;
else
{
ok=false;
break;
}
}
}
if(s1[s1.size()-1]=='A') ok=false;
if(ok&&have_b) cout<<"YES"<<'\n';
else cout<<"NO"<<'\n';
}
int main()
{
close();
int T; cin>>T;
while (T--) solve();
return 0;
}
//AAAABAAABA238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |