//////////////////////////////////////////// _LeMur_
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#include <unordered_map>
#include <unordered_set>
#include <functional>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cassert>
#include <chrono>
#include <random>
#include <bitset>
#include <cstdio>
#include <vector>
#include <string>
#include <ctime>
#include <stack>
#include <queue>
#include <cmath>
#include <list>
#include <map>
#include <set>
using namespace std;
const int N = 10005;
const int inf = 1000 * 1000 * 1000;
const int mod = 998244353;
int n , m;
string s;
bitset <N> mas[N];
bitset <N> A;
vector <int> vec;
vector <int> g;
int cnt[N];
vector <int> gr[N];
int main(){
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
cin >> n >> m;
cin >> s;
for(int i=0;i<m;i++){
char c1 , c2;
int x1 , x2;
bool flag = false;
cin >> c1 >> x1;
cin >> c2 >> x2;
--x1;
--x2;
if(c1 == 'x')
mas[i][x1] = '1';
else{
mas[i] |= mas[x1];
if(s[i] && s[x2]) flag = true;
}
if(c2 == 'x')
mas[i][x2] = '1';
else{
mas[i] |= mas[x2];
if(s[i] && s[x2]) flag = true;
}
if(s[i] == '0'){
A |= mas[i];
}
if(s[i] == '1' && !flag){
vec.push_back(i);
}
}
for(int i=0;i<n;i++){
if(A[i] == 1){
for(int j=0;j<m;j++){
mas[j][i] = 0;
}
}
}
for(int j=0;j<m;j++){
cnt[j] = mas[j].count();
if(mas[j].count() == 0){
s[j] = '0';
}
}
for(int i=0;i<m;i++){
if(s[i] == '?'){
for(int j=0;j<(int)vec.size();j++){
int id = vec[j];
if(cnt[i] < cnt[id])continue;
if((mas[i] & mas[id]) == mas[id]){
s[i] = '1';
break;
}
}
}
}
cout << s << endl;
return 0;
}
