#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001

using A = array<array<int,30>,2>;

A op(A a,A b){
	return a;
}

A e(){
	A ret;
	rep(i,30){
		rep(j,2){
			ret[j][i] = j;
		}
	}
	return ret;
}

A mapping(A a,A b){
	rep(i,30){
		rep(j,2){
			b[j][i] = a[b[j][i]][i];
		}
	}
	return b;
}

A composition(A a,A b){
	rep(i,30){
		rep(j,2){
			b[j][i] = a[b[j][i]][i];
		}
	}
	return b;
}

A id(){
	A ret;
	rep(i,30){
		rep(j,2){
			ret[j][i] = j;
		}
	}
	return ret;
}

int main(){
	
	int N,Q;
	cin>>N>>Q;
	
	vector<int> m(N);
	rep(i,N)cin>>m[i];
	lazy_segtree<A,op,e,A,mapping,composition,id> seg(N);
	rep(i,Q){
		char c;
		cin>>c;
		int l,r,x;
		cin>>l>>r>>x;
		l--;
		//cout<<l<<endl;
		A t = e();
		//cout<<r<<endl;
		rep(j,30){
			//cout<<j<<endl;
			if(c=='o'){
				if((x>>j)&1)t[0][j] = 1,t[1][j] = 1;
				else t[0][j] = 0,t[1][j] = 1;
			}
			else{
				if((x>>j)&1)t[0][j] = 1,t[1][j] = 0;
				else t[0][j] = 0,t[1][j] = 1;
			}
		}
		
		seg.apply(l,r,t);
	}
//	cout<<'h'<<endl;
	vector<mint> dp(31,0);
	dp[0] = 1;
	rep(i,N){
		auto ret = seg.get(i);
		vector tdp(31,vector<mint>(2,0));
		int M = m[i];
		tdp[0][0] = 1;
		for(int j=29;j>=0;j--){
			vector ndp(31,vector<mint>(2,0));
			rep(k,31){
				rep(l,2){
					if(tdp[k][l]==0)continue;
					rep(n,2){
						int kk = k,ll = l;
						if(ret[n][j])kk++;
						if(l==0){
							if((M>>j)&1){
								if(n==0)ll++;
							}
							else{
								if(n==1)continue;
							}
						}
						ndp[kk][ll] += tdp[k][l];
					}
				}
			}
			swap(tdp,ndp);
		}
		vector<mint> ndp(31,0);
		rep(j,31){
			rep(k,31){
				ndp[max(j,k)] += dp[j] * (tdp[k][0] + tdp[k][1]);
			}
		}
		swap(dp,ndp);
	}
	mint ans = 0;
	rep(i,dp.size())ans += dp[i] * i;
	cout<<ans.val()<<endl;
	
	return 0;
}