#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
#define int long long
#define ll long long
#define y1 YONE
typedef unsigned long long ull;
using namespace std;
const int N=1e6+5;
int n,q,b[N],c[N];
char a[N];
bool f(int l,int r){
    //cout<<l<<' '<<r<<endl;
    if (!l && !r) return 0/0;
    // if a[l...r] is of form [n]:
    if (a[l]=='[' && c[l]==r){
        int x=0,p=1;
        for (int i=r-1;i>l;i--){
            x+=p*(a[i]-'0');
            p*=10;
        }
        return b[1]>=x;
    }
    // if a[l...r] is of form (f):
    if (a[l]=='(' && c[l]==r){
        return f(l+1,r-1);
    }
    // if a[l...r] is of form !!!!x:
    if (a[l]=='!' && c[l]==r) return !f(l+1,r);
    bool x=0,y=0,z=0;
    for (int i=l;i<=r && !x;i++){
        if (a[i]=='(') {i=c[i];continue;}
        x|=(a[i]=='|');
        y|=(a[i]=='^');
        z|=(a[i]=='&');
    }
    if (x){
        for (int i=l;i<=r;i++){
            if (a[i]=='(') {i=c[i];continue;}
            if (a[i]!='|') continue;
            return f(l,i-1)|f(i+1,r);
        }
    }
    if (y){
        for (int i=l;i<=r;i++){
            if (a[i]=='(') {i=c[i];continue;}
            if (a[i]!='^') continue;
            return f(l,i-1)^f(i+1,r);
        }
    }
    if (z){
        for (int i=l;i<=r;i++){
            if (a[i]=='(') {i=c[i];continue;}
            if (a[i]!='&') continue;
            return f(l,i-1)&f(i+1,r);
        }
    }
    return f(0,0);
}
int32_t main(){
    //ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n>>q;
    for (int i=1;i<=n;i++) cin>>a[i];
    for (int i=1;i<=q;i++) cin>>b[i];
    stack<int> s;
    for (int i=1;i<=n;i++){
        if (a[i]=='(') s.push(i);
        elif (a[i]==')'){
            c[s.top()]=i;
            c[i]=s.top();
            s.pop();
        }
    }
    for (int i=1;i<=n;i++){
        if (a[i]=='[') s.push(i);
        elif (a[i]==']'){
            c[s.top()]=i;
            c[i]=s.top();
            s.pop();
        }
    }
    for (int i=1;i<=n;i++){
        if (a[i]!='!') continue;
        int r=i;
        for (int j=i;j;j++){
            if (a[j]=='!') r=j;
            else break;
        }
        for (int j=i;j<=r;j++) c[j]=c[r+1];
        i=r;
    }
    if (f(1,n)) cout<<"True"<<endl;
    else cout<<"False"<<endl;
    return 0;
}