#include<iostream>

#include<cstring>

#include<cstdio>

#include<cmath>

#include<stack>

using namespace std;

#define INF 0x3f3f3f3f

struct NODE

{

    int num;

    int lc,rc;

};

NODE node[];

int match[],tot,len;

char str[];

bool is_a_int(char a);

bool is_a_father(int id,int number)

{

    node[tot].num = number;

    if(str[id+] == ':')

    {

        return true;

    }

    else

    {

        node[tot].lc = node[tot].rc = INF;

        return false;

    }

}

void find_child(int id)

{

    int start,length,now,end,cnt,number;

    if(str[id+] == '[')

    {

        start = id+,length = ,now = start,end;

        while(is_a_int(str[now]) && is_a_int(str[now+]))

        {

            length++;

            now++;

        }

        cnt = ,number = ;

        end = start + length;

        while(cnt <= length)

        {

            number += pow(,cnt) * (str[end-cnt] - '');

            cnt++;

        }

        node[tot].lc = number;

    }

    else if(str[id+] == '(')

    {

        if(!is_a_int(str[id+]))

            node[tot].lc = INF;

        else

        {

            start = id+,length = ,now = start,end;

            while(is_a_int(str[now]) && is_a_int(str[now+]))

            {

                length++;

                now++;

            }

            cnt = ,number = ;

            end = start + length;

            while(cnt <= length)

            {

                number += pow(,cnt) * (str[end-cnt] - '');

                cnt++;

            }

            node[tot].lc = number;

        }

    }

    int douhao_id = match[id+];

    if(str[douhao_id+] == '(' && str[douhao_id+] == ')')

        node[tot].rc = INF;

    else if(is_a_int(str[douhao_id+]))

    {

        start = douhao_id+,length = ,now = start,end;

        while(is_a_int(str[now]) && is_a_int(str[now+]) )

        {

            length++;

            now++;

        }

        cnt = ,number = ;

        end = start + length;

        while(cnt <= length)

        {

            number += pow(,cnt) * (str[end-cnt] - '');

            cnt++;

        }

        node[tot].rc = number;

    }

    else if(str[douhao_id+] == '[')

    {

        start = douhao_id+,length = ,now = start,end;

        while(is_a_int(str[now]) && is_a_int(str[now+]) )

        {

            length++;

            now++;

        }

        cnt = ,number = ;

        end = start + length;

        while(cnt <= length)

        {

            number += pow(,cnt) * (str[end-cnt] - '');

            cnt++;

        }

        node[tot].rc = number;

    }

}

bool is_a_int(char a)

{

    if(a >= '' && a <= '')

        return true;

    else return false;

}

int main()

{

    int t;

    cin>>t;

    while(t--)

    {

        cin>>str;

        stack<int> s;

        while(!s.empty()) s.pop();

        int len = strlen(str);

        memset(match,,sizeof(match));

        for(int i = ; i < len; i++)

        {

            if(str[i] == ':')

                s.push(i);

            else if(str[i] == ',')

            {

                match[s.top()] = i;

                s.pop();

            }

        }

        tot = ;

        for(int i = ; i < len-; i++)

        {

            if(is_a_int(str[i]))

            {

                int start_id = i,length = ;

                int now_id = start_id;

                while(is_a_int(str[now_id]) && is_a_int(str[now_id + ]) )

                {

                    length++;

                    now_id++;

                }

                int end_id = start_id + length;

                int cnt = ,number = ;

                while(cnt <= length)

                {

                    number += pow(,cnt) * (str[end_id - cnt] - '');

                    cnt++;

                }

                ///cout<<number<<endl;

                bool flag = is_a_father(end_id,number);

                if(flag)

                {

                    find_child(end_id);

                }

                tot++;

                i += length;

            }

        }

        /*for(int i = 0; i < tot; i++)

        {

            cout<<node[i].num<<endl;

            cout<<node[i].lc<<" "<<node[i].rc<<endl;

        }*/

        bool flag1 = true;

        for(int i = ; i < tot; i++)

        {

            if(node[i].lc != INF && node[i].num < node[i].lc)

            {

                flag1 = false;

                break;

            }

            if(node[i].rc != INF && node[i].num < node[i].rc)

            {

                flag1 = false;

                break;

            }

        }

        bool flag2 = true;

        for(int i = ; i < tot; i++)

        {

            if(node[i].lc != INF && node[i].num > node[i].lc)

            {

                flag2 = false;

                break;

            }

            if(node[i].rc != -INF && node[i].num > node[i].rc)

            {

                flag2 = false;

                break;

            }

        }

        if(flag1 || flag2)

            puts("Yes");

        else puts("No");

    }

    return ;

}