Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Boolean Function

time limit per test

4 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputIn this problem we consider Boolean functions of four variables *A*, *B*, *C*, *D*. Variables *A*, *B*, *C* and *D* are logical and can take values 0 or 1. We will define a function using the following grammar:

<expression> ::= <variable> | (<expression>) <operator> (<expression>)

<variable> ::= 'A' | 'B' | 'C' | 'D' | 'a' | 'b' | 'c' | 'd'

<operator> ::= '&' | '|'

Here large letters *A*, *B*, *C*, *D* represent variables, and small letters represent their negations. For example, if *A* = 1, then character 'A' corresponds to value 1, and value character 'a' corresponds to value 0. Here character '&' corresponds to the operation of logical AND, character '|' corresponds to the operation of logical OR.

You are given expression *s*, defining function *f*, where some operations and variables are missing. Also you know the values of the function *f*(*A*, *B*, *C*, *D*) for some *n* distinct sets of variable values. Count the number of ways to restore the elements that are missing in the expression so that the resulting expression corresponded to the given information about function *f* in the given variable sets. As the value of the result can be rather large, print its remainder modulo 10^{9} + 7.

Input

The first line contains expression *s* (1 ≤ |*s*| ≤ 500), where some characters of the operators and/or variables are replaced by character '?'.

The second line contains number *n* (0 ≤ *n* ≤ 2^{4}) — the number of integers sets for which we know the value of function *f*(*A*, *B*, *C*, *D*). Next *n* lines contain the descriptions of the sets: the *i*-th of them contains five integers *a*_{i}, *b*_{i}, *c*_{i}, *d*_{i}, *e*_{i} (0 ≤ *a*_{i}, *b*_{i}, *c*_{i}, *d*_{i}, *e*_{i} ≤ 1), separated by spaces and meaning that *f*(*a*_{i}, *b*_{i}, *c*_{i}, *d*_{i}) = *e*_{i}.

It is guaranteed that all the tuples (*a*_{i}, *b*_{i}, *c*_{i}, *d*_{i}) are distinct.

Output

In a single line print the answer to the problem.

Examples

Input

?

2

1 0 1 0 1

0 1 1 0 1

Output

2

Input

(A)?(?)

1

1 1 0 0 0

Output

4

Input

((?)&(?))|((?)&(?))

0

Output

4096

Input

b

1

1 0 1 1 1

Output

1

Note

In the first sample the two valid expressions are 'C' and 'd'.

In the second sample the expressions look as follows: '(A)&(a)', '(A)&(b)', '(A)&(C)', '(A)&(D)'.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/19/2019 12:03:15 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|