#include <bits/stdc++.h>
using namespace std;
using ll = long long;

bool solve(const string& s) {
	int length = 0, up = 0, down = 0;
	for (const char c : s) {
		if (c == '(') {
			length += 1;
			up += 1;
		} else if (c == ')') {
			length += 1;
			down += 1;
		} else {
			length -= c - '0';
		}
	}	
	if (length & 1) return false;
	if (up < length / 2) return false;
	if (down < length / 2) return false;
	up -= length / 2;
	down -= length / 2;
	const int n = (int)s.size();
	deque<int> u, d;
	for (int i = 0; i < n; ++i) {
		if (s[i] == '(') {
			u.push_back(i);
		} else if (s[i] == ')') {
			d.push_back(i);
		} else {
			int remove = s[i] - '0';
			while (!d.empty() && remove > 0 && down > 0) {
				d.pop_front();
				remove -= 1;
				down -= 1;
			}
			while (remove > 0) {
				if (u.empty()) return false;
				u.pop_back();
				remove -= 1;
				up -= 1;
			}
		}
 	}
	vector<char> use(n);
	for (const int i : u) use[i] = true;
	for (const int i : d) use[i] = true;
	int c = 0;
	for (int i = 0; i < n; ++i) if (use[i]) {
		if (s[i] == '(') c += 1;
		else c -= 1;
		if (c < 0) return false;
	}
	return c == 0;
}

int main() {
	cin.tie(nullptr)->sync_with_stdio(false);

	int t;
	cin >> t;
	while (t--) {
		string s;
		cin >> s;
		cout << (solve(s) ? "Yes" : "No") << '\n';
	}

	return 0;
}