/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
void solve()
{
	string S;
	cin>>S;
	int cl=0,cr=0,ce=0;
	for(int i=0;i<S.size();i++)
	{
		if(S[i]=='(') cl++;
		else if(S[i]==')') cr++;
		else ce+=S[i]-'0';
	}
	int dl=0,dr=0;
	while(ce--)
	{
		if(cl>cr) cl--,dl++;
		else cr--,dr++; 
	}
	if(cl!=cr||cl<0||cr<0)
	{
		cout<<"No\n";
		return; 
	}
	set <pii > S1,S2;
	for(int i=0;i<S.size();i++)
	{
		if(S[i]=='(') S1.insert(mp(i,1));
		else if(S[i]==')') S2.insert(mp(i,-1));
		else
		{
			int c=S[i]-'0';
			while(c--)
			{
				if(dr&&S2.size()) S2.erase(S2.begin()),dr--;
				else if(dl&&S1.size()) S1.erase(prev(S1.end())),dl--;
				else
				{
					cout<<"No\n";
					return;
				}
			}
		}
	}
	vector <pii > vec;
	for(auto it=S1.begin();it!=S1.end();it++) vec.pb(*it);
	for(auto it=S2.begin();it!=S2.end();it++) vec.pb(*it);
	sort(vec.begin(),vec.end());
	for(int i=0,s=0;i<vec.size();i++)
	{
		s+=vec[i].se;
		if(s<0)
		{
			cout<<"No\n";
			return;
		}
	}
	cout<<"Yes\n";
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
	cin>>_;
	while(_--) solve();
	return 0;
}