#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define int long long
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update>;


int INF = 1e18; 
const int MOD = 998244353;
const int N = 5e5 + 10;
const int LOG = 20;
const int dx[4] = {0, 0, 1, -1};
const int dy[4] = {1, -1, 0, 0};

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int a[N];

void solve(){
    string s;
    cin >> s;
    int n = s.size();

    string t = "", st = "";

    for(char& c : s){
        if(c == ')') c = '(';
        if(c == ']') c = '[';

        if(st.back() == c){
            st.pop_back();
            if(c == '(') c = ')';
            else c = ']';
        } else{
            st.push_back(c);
        }
    }

    s = ' ' + s + ' ';
    vector<int> st1, st2;
    vector<int> pos(n+1);

    for(int i = 1; i <= n; i++){
        if(s[i] == '(') st1.push_back(i);
        else if(s[i] == '[') st2.push_back(i);
        else if(s[i] == ')'){
            pos[st1.back()-1] = i;
            st1.pop_back();
        } else{
            pos[st2.back()-1] = i;
            st2.pop_back();
        }
    }

    bool ok = true;

    for(int i = 1; i <= n; i++){
        if(s[i] == ')' && s[i+1] == '(') ok = false;
        if(s[i] == ']' && s[i+1] == '[') ok = false;
        if(pos[i] && s[i] == ')' && s[pos[i]+1] == '(') ok = false;
        if(pos[i] && s[i] == ']' && s[pos[i]+1] == '[') ok = false;
    }

    if(ok) cout << "Yes\n";
    else cout << "No\n";
}


int32_t main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int tt;
    cin >> tt;

    while(tt--){
        solve();
    }
}