#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 20010, LOG=20;
int n, m, k, u, v, x, y, t, a, b;
int A[MAXN][2];
vector<int> G[MAXN];
string S, ans;
bool check(){
for (int i=n+m-1; i>=n; i--) if (S[i]=='0'){
if (S[A[i][0]]=='1') return 0;
S[A[i][0]]='0';
if (S[A[i][1]]=='1') return 0;
S[A[i][1]]='0';
}
for (int i=0; i<n; i++) if (S[i]=='?') S[i]='1';
for (int i=n; i<n+m; i++){
bool f=(S[A[i][0]]=='1' || S[A[i][1]]=='1');
if (S[i]=='1' && !f) return 0;
if (S[i]=='0' && f) return 0;
S[i]='0'+f;
}
return 1;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
cin>>n>>m>>S;
for (int i=n; i<n+m; i++){
char c1, c2;
cin>>c1>>x>>c2>>y;
if (c1=='c') x+=n;
if (c2=='c') y+=n;
x--;
y--;
G[x].pb(i);
G[y].pb(i);
A[i][0]=x;
A[i][1]=y;
}
for (int i=0; i<n; i++) ans+='?';
ans+=S;
for (int i=n; i<n+m; i++) if (ans[i]=='?'){
S=ans;
S[i]='0';
if (!check()){
ans[i]='1';
continue ;
}
S=ans;
S[i]='1';
if (!check()){
ans[i]='0';
continue ;
}
ans[i]='?';
}
for (int i=n; i<n+m; i++) cout<<ans[i];
return 0;
}
