DSA02015 - LOẠI BỎ DẤU NGOẶC

//Made By Phuong Nam PROPTIT <3//
#pragma GCC Optimize("O3")
#include<bits/stdc++.h>
#include<string>
#include<vector>
#define alphaa "abcdefghijklmnopqrstuvwxyz"
#define ALPHAA "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define f(i,a,b) for(int i=a;i<=b;i++)
#define f1(i,n) for(int i=1;i<=n;i++)
#define f0(i,n) for(int i=0;i<n;i++)
#define ff(i,b,a) for(int i=b;i>=a;i--)
#define el cout<<'\n'
#define fi first
#define se second
#define pb push_back
#define pk pop_back
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(s) s.begin(),s.end()
using namespace std;
typedef long long ll;
const int N=1e6+3;
const int MOD=1e9+7;
template<class X,class Y>
    void minimize(X &x,const Y &y) {
        if (x>y) x=y;
    }
template<class X,class Y>
    void maximize(X &x,const Y &y) {
        if (x<y) x=y;
    }
template<class T>
    T Abs(const T &x) {
        return (x<0?-x:x);
    }
int len;
string s;
map<string,int>v;
bool kt(string b)
{
    if(b.size()<2) return 0;
    stack<int>a;
    f0(i,b.size())
    {
        if(b[i]=='(') a.push(1);
        else if(b[i]==')')
        {
           if(a.empty()) return 0;
           a.pop();
        }
    }
    if(a.empty()) return 1;
    return 0;
}
void quay(string a,int pos)
{
   if(kt(a))
   {
       if(a.size()>len)
       {
           len=a.size();
           v.clear();
           v[a]++;
       }
       else if(a.size()==len) v[a]++;
       return;
   }
   for(int i=pos+1;i<a.size();i++)
    {
        if(a[i]=='('||a[i]==')')
        {
            string x=a;
            x.erase(x.begin()+i,x.begin()+i+1);
            quay(x,i-1);
        }
    }
}
void xuly()
{
   len=0;
   v.clear();
   cin>>s;
   quay(s,-1);
   if(v.empty()) cout<<-1;
   else
   {
        for(auto i:v) cout<<i.fi<<" ";
   }
   el;
}
int main()
{
  ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  int t=1;
  cin>>t;
  while(t--) xuly();
  return 0;
}
//-----YEU CODE HON CRUSH-----//