#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define prArr(a) {cerr<<(#a)<<"={";int i=0;for(auto t:(a))cerr<<(i++?", ":"")<<t;cerr<<"}"<<endl;}
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){
  return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
//INSERT ABOVE HERE



void count(Int &a, Int &b, Int &c, char ch){
  if(ch == '(') a++;
  if(ch == ')') a--;
  if(ch == '{') b++;
  if(ch == '}') b--;
  if(ch == '[') c++;
  if(ch == ']') c--;
  assert(a >= 0 && b >= 0 && c >= 0);
}

Int check(vector<string> &code, Int R, Int C, Int S){
  Int a = 0, b = 0, c = 0;
  for(string &s: code){
    Int idx = 0;
    Int cnt = 0;
    while(idx < (Int)s.size() && s[idx] == '.') idx++, cnt++;

    if(R * a + C * b + S * c != cnt) return 0;
    while(idx < (Int)s.size()) count(a, b, c, s[idx++]);
  }
  assert(a == 0 && b == 0 && c == 0);
  return 1;
}

using T = tuple<Int,Int,Int>;
map<T, Int> calcMem(vector<string> &code){
  Int a = 0, b = 0, c = 0;
  map<T, Int> res;
  for(string &s: code){
    Int idx = 0;
    Int cnt = 0;
    while(idx < (Int)s.size() && s[idx] == '.') idx++, cnt++;
    res[T(a, b, c)] = cnt;
    while(idx < (Int)s.size()) count(a, b, c, s[idx++]);
  }
  return res;
}




signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  while(1){
    Int n, m;
    cin>>n>>m;
    if(n == 0 && m == 0) break;
    vector<string> code1(n);
    cin>>code1;
    vector<string> code2(m);
    cin>>code2;

    set<Int> R, C, S;
    for(Int i=1;i<=20;i++)
      for(Int j=1;j<=20;j++)
        for(Int k=1;k<=20;k++){
          if(!check(code1, i, j, k)) continue;
          R.insert(i);
          C.insert(j);
          S.insert(k);
        }

    {
      map<T, Int> mem = calcMem(code1);
      vector<Int> ans;
      Int a = 0, b = 0, c = 0;
      for(string s:code2){
        Int num = 0;
        Int valid = 1;
        if(a != 0){
          valid &= R.size() == 1;
          if(valid) num += *R.begin() * a;
        }
        if(b != 0){
          valid &= C.size() == 1;
          if(valid) num += *C.begin() * b;
        }
        if(c != 0){
          valid &= S.size() == 1;
          if(valid) num += *S.begin() * c;
        }

        if(mem.count(T(a, b, c))) {valid = 1, num = mem[T(a, b, c)];}

        Int idx = 0;
        while(idx < (Int)s.size()) count(a, b, c, s[idx++]);
        if(!valid) ans.push_back(-1);
        else ans.push_back(num);
        }
        cout<<ans<<endl;
      }
    }
    return 0;
}



Measured memory_bytes: 3228