/*
4种情况
1.字符串s本身回文aaa
2.全为"lqb"字符,补充另一半即可
lqb ==> bql_lqb
3.前部分回文
ioilqb ==> bql_ioilqb
4.部分回文
bioi_blq ==>ql_bioi_blq
*/
#include <iostream>
using namespace std;
bool ishui(string s){
    int n = s.size();
    for (int i = 0; i < n / 2; ++i) {
        if(s[i] != s[n-i-1]){
            return false;
        }
    }
    return  true;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int t;cin >> t;
    while(t--){
        string s;cin >> s;
        int n = s.size();
        if(ishui(s)){
            cout << "Yes\n";
            continue;
        }else{
            int start_ = 0,end_ = 0;
            bool status = true;
            for (int i = 0; i < n ; ++i) {
                if(s[i] != 'l'&&s[i] != 'q' && s[i] != 'b'){
                    start_ = i;
                    status = false;
                    break;
                }
            }
            if(status) {
                cout << "Yes\n";
                continue;
            }else{
                string pre_s = "";
                for (int i = n-1; i >= 0 ; i--) {
                    if(s[i] != 'l'&&s[i] != 'q' && s[i] != 'b'){
                        end_ = i;
                        break;
                    }
                }
                for (int i = 0; i <= end_ ; ++i) {
                    pre_s += s[i];
                }
                if(ishui(pre_s)){
                    cout << "Yes\n";
                    continue;
                }else{
                    string mid_s = "";
                    for (int i = start_; i <= end_; ++i) {
                        mid_s +=s[i];
                    }
                    if(ishui(mid_s)){
                        string left_s = "",right_s = "";
                        for (int i = start_ -1; i >= 0 ; i--) {
                            left_s += s[i];
                        }
                        for (int i = end_ + 1 ; i <= n ; i++) {
                            right_s += s[i];
                        }
                        for (int i = 0; i < left_s.size(); ++i) {
                            if(left_s[i] !=right_s[i]){
                                cout << "No\n";
                                break;
                            }else if(i == left_s.size()-1){
                                cout << "Yes\n";
                            }
                        }
                    }else{
                        cout << "No\n";
                        continue;
                    }
                }
            }
        }
    }
    return 0;
}