// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T &x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T &x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 1e6 + 10;
int type[N];
int n1[N], n2[N], p1[N], p2[N], q[N], nn[N], pp[N];
// bool t[N];
// bool a[N], b[N];
vector <pair <int, int>> t1, t2;
string query(string st) {
	int n = st.size();
	st = ' ' + st;
	stack <int> s1, s2;
	F(i, 1, n) {
		if (st[i] == ')') st[i] = '(';
		if (st[i] == ']') st[i] = '[';
		if (st[i] == '(') {
			if (s1.size() && (s2.empty() || s1.top() > s2.top())) {
				// type[s1.top()] = type[i] = t1.size();
				t1.emplace_back(s1.top(), i);
				st[i] = ')', s1.pop();
			} else s1.push(i);
		} else {
			if (s2.size() && (s1.empty() || s2.top() > s1.top())) {
				// debug << t2.size() << endl;
				// type[s2.top()] = type[i] = t2.size();
				t2.emplace_back(s2.top(), i);
				st[i] = ']', s2.pop();
			} else s2.push(i);
		}
	}
	return st;
}
// string query2(string st) {
// 	int n = st.size();
// 	st = ' ' + st;
// 	stack <int> s1, s2;
// 	DF(i, n, 1) {
// 		if (st[i] == '(') st[i] = ')';
// 		if (st[i] == '[') st[i] = ']';
// 		if (st[i] == ')') {
// 			if (s1.size() && (s2.empty() || s1.top() < s2.top())) st[i] = '(', s1.pop();
// 			else s1.push(i);
// 		} else {
// 			if (s2.size() && (s1.empty() || s2.top() < s1.top())) st[i] = '[', s2.pop();
// 			else s2.push(i);
// 		}
// 	}
// 	return st;
// }
void zhk() {
	t1.clear(), t2.clear();
	string st;
	cin >> st;
	// if (query1(st) == query2(st)) puts("Yes");
	// else puts("No");
	int n = st.size();
	st = query(st);
	sort(all(t1)), sort(all(t2));
	F(i, 0, SZ(t1)) type[t1[i].first] = type[t1[i].second] = i;
	F(i, 0, SZ(t2)) type[t2[i].first] = type[t2[i].second] = i;
	// F(i, 1, n) a[i] = b[i] = false;
	// F(i, 1, n) s1[i] = s2[i] = 1e9;
	// st = ' ' + st;
	// debug << st << endl;
	// bool c1 = true, c2 = true;
	// int lst1 = 0, lst2 = 0;
	set <int> S;
	S.insert(1e9);
	F(i, 1, n) {
		if (st[i] == ')') S.erase(i);
		n1[i] = *S.begin();
		if (st[i] == '(') S.insert(t1[type[i]].second);
	}
	// F(i, 1, n) cout << type[i] << " "; cout << endl;
	// debug << S.size() << endl;
	// debug << st << endl;
	F(i, 1, n) {
		if (st[i] == ']') S.erase(i);
		n2[i] = *S.begin();
		if (st[i] == '[') S.insert(t2[type[i]].second);
	}
	S.clear();
	S.insert(0);
	DF(i, n, 1) {
		if (st[i] == '(') S.erase(i);
		p1[i] = *S.rbegin();
		if (st[i] == ')') S.insert(t1[type[i]].first);
	}
	DF(i, n, 1) {
		if (st[i] == '[') S.erase(i);
		p2[i] = *S.rbegin();
		if (st[i] == ']') S.insert(t2[type[i]].first);
	}
	F(i, 1, n) nn[i] = min(n1[i], n2[i]), pp[i] = max(p1[i], p2[i]);
	// F(i, 2, n) {
	// 	chkmin(s1[i], s1[i - 1]);
	// 	chkmin(s2[i], s2[i - 1]);
	// }
	// int mx = 0;
	int r = 0;
	F(i, 0, SZ(t1)) {
		// debug << nn[t1[i].first] << " " << pp[t1[i].first] << endl;
		while (r && nn[t1[q[r]].first] <= t1[i].first) r--;
		// debug << r << endl;
		if (r && pp[t1[i].first] < t1[q[r]].first) {
			// debug << t1[i].first << " " << t1[i].second << endl;
			puts("No");
			return;
		}
		while (r && nn[t1[q[r]].first] <= nn[t1[i].first]) r--;
		q[++r] = i;
	}
	r = 0;
	F(i, 0, SZ(t2)) {
		while (r && nn[t2[q[r]].first] <= t2[i].first) r--;
		if (r && pp[t2[i].first] < t2[q[r]].first) {
			// debug << t2[i].first << " " << t2[i].second << endl;
			puts("No");
			return;
		}
		while (r && nn[t2[q[r]].first] <= nn[t2[i].first]) r--;
		q[++r] = i;
	}
	// // F(i, 0, SZ(t2) - 1)
	// // 	if (n1[t2[i].second] > t2[i + 1].second && p1[t2[i + 1].first] < t2[i].first) {
	// // 		puts("No");
	// // 		return;
	// // 	}
	puts("Yes");
}
signed main() {
	int _ = 1;
	cin >> _;
	while (_--) zhk();
	return 0;
}
/* why?
*/