#include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<ll(n);++i)
#define RREP(i,n) for(ll i=ll(n)-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<ll(n);++i)
#define RFOR(i,m,n) for(ll i=ll(n)-1;i>=ll(m);--i)
#define ALL(v) (v).begin(),(v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v).size()) { cout << v[aa]; if (aa != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

const int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
const int dy[8] = { 0,1,1,1,0,-1,-1,-1 };


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n, m;
	while (cin >> n >> m, n) {
		vector<string> p(n), q(m);
		REP(i, n)cin >> p[i];
		REP(i, m)cin >> q[i];
		vi ind(n);
		REP(i, n) {
			int cnt = 0;
			REP(j, p[i].size()) {
				if (p[i][j] != '.')break;
				cnt++;
			}
			ind[i] = cnt;
		}
		vi res(m, -1);
		REP(i, 20)REP(j, 20)REP(k, 20) {
			int r = 0, c = 0, s = 0;
			bool ok = true;
			REP(a, n) {
				if (ind[a] != (i + 1)*r + (j + 1)*c + (k + 1)*s)ok = false;
				REP(b, p[a].size()) {
					if (p[a][b] == '(')r++;
					else if (p[a][b] == ')')r--;
					else if (p[a][b] == '{')c++;
					else if (p[a][b] == '}')c--;
					else if (p[a][b] == '[')s++;
					else if (p[a][b] == ']')s--;
				}

			}
			if (!ok)continue;
			r = 0, c = 0, s = 0;
		
			REP(a, m) {
				if(res[a]==-1)res[a] = (i + 1)*r + (j + 1)*c + (k + 1)*s;
				else if(res[a]!=(i + 1)*r + (j + 1)*c + (k + 1)*s)res[a] = INF;
				REP(b, q[a].size()) {
					if (q[a][b] == '(')r++;
					else if (q[a][b] == ')')r--;
					else if (q[a][b] == '{')c++;
					else if (q[a][b] == '}')c--;
					else if (q[a][b] == '[')s++;
					else if (q[a][b] == ']')s--;
				}
			}

		}
		REP(i, m) {
			if (i)cout << " ";
			if (res[i] == INF)cout << -1;
			else cout << res[i];
		}
		cout << endl;
	}
}
