#include <stdio.h>
#include <string.h>

#define MAX_L 1010
#define MAX_N 110

int t, n, i, j, k, len, next, ok;
int v[MAX_N];
char s[MAX_L];

struct numar {
	int x;
	int y;
} p1, p2, alfa;

void caut(int k) {
	alfa.x = alfa.y = 0;
	for (int i = 0; i < len; i++)
		if (k >= 10) {
			if (s[i] - 48 == k / 10 && s[i + 1] - 48 == k % 10) {
				alfa.x = i; alfa.y = i + 1; 
				break;
			}
		}
		else 
			if (s[i] - 48 == k) {
				alfa.x = i; alfa.y = i;
				break;
			}
}

int follow(int poz) {
	int k = 0;
	if (poz + 1 < len) {
		if (s[poz + 1] == '>') {
			k = s[poz + 2] - 48;
			if (poz + 3 < len && ('0' <= s[poz + 3] && s[poz + 3] <= '9'))
				k = k * 10 + s[poz + 3] - 48;
		}
	}
	if (k) return k;
	else return 0;
}

int main() {

	freopen("episoade.in", "r", stdin);
	freopen("episoade.out", "w", stdout);
	
	scanf("%s", s); len = strlen(s);
	scanf("%d %d", &t, &n);
	
	//programul fara paranteze
	while (t--) {
		for (i = 1; i <= n; i++)
			scanf("%d", &v[i]);
		
		ok = 1; next = 0;
		for (i = 1; i < n; i++) {
			caut(v[i]); p1 = alfa;
			next = follow(p1.y);
			
			if (next && v[i + 1] != next) {
				ok = 0;
				break;
			}
			
			caut(v[i + 1]); p2 = alfa;
			next = follow(p2.y);
			
			if (next && v[i + 2] != next) {
				ok = 0;
				break;
			}
		}
		printf("%d\n", ok);
	}
	
	return 0;
}