#include <iostream>
#include <bitset>
#include <random>
#include <chrono>
#include <iomanip>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <string>
#include <stack>
#include <ranges>
#include <algorithm>
#include <vector>
using namespace std;
using ll=long long;

#include <atcoder/all>
using mint=atcoder::modint998244353;

ostream& operator<<(ostream& os,const mint& x){
	os<<x.val();
	return os;
}
istream& operator>>(istream& is,mint& x){
	int t;
	is>>t;
	x=t;
	return is;
}

template <typename S,typename T>
ostream& operator<<(ostream& os,const pair<S,T>& p);
template <typename S,typename T>
istream& operator>>(istream& is,pair<S,T>& p);
template <typename T,size_t n>
ostream& operator<<(ostream& os,const array<T,n>& arr);
template <typename T,size_t n>
istream& operator>>(istream& is,array<T,n>& arr);
template <typename T>
ostream& operator<<(ostream& os,const vector<T>& vec);
template <typename T>
istream& operator>>(istream& is,vector<T>& vec);

template <typename S,typename T>
ostream& operator<<(ostream& os,const pair<S,T>& p){
	os<<p.first<<" "<<p.second;
	return os;
}
template <typename S,typename T>
istream& operator>>(istream& is,pair<S,T>& p){
	is>>p.first>>p.second;
	return is;
}

template <typename T,size_t n>
ostream& operator<<(ostream& os,const array<T,n>& arr){
	for(int i=0;i<n;i++)os<<arr[i]<<(i+1==n?"":" ");
	return os;
}
template <typename T,size_t n>
istream& operator>>(istream& is,array<T,n>& arr){
	for(int i=0;i<n;i++)is>>arr[i];
	return is;
}
template <typename T>
ostream& operator<<(ostream& os,const vector<T>& vec){
	for(int i=0;i<(int)vec.size();i++)os<<vec[i]<<(i+1==(int)vec.size()?"":" ");
	return os;
}
template <typename T>
istream& operator>>(istream& is,vector<T>& vec){
	for(int i=0;i<(int)vec.size();i++)is>>vec[i];
	return is;
}

template<class... Vecs>
void input_vec(Vecs&... vs) {
    const auto n = get<0>(tie(vs...)).size();

    for (size_t i = 0; i < n; ++i)
        ((cin >> vs[i]), ...);
}

template <class... Vecs>
void output_vec(const Vecs&... vs) {
    const auto n = get<0>(tie(vs...)).size();

    for (size_t i = 0; i < n; ++i) {
        bool first = true;
        (((cout << (exchange(first, false) ? "" : " ") << vs[i])), ...);
        cout << endl;
    }
}

template <typename T>
vector<T> make_unique(vector<T> vec){
	ranges::sort(vec);
	vec.erase(unique(vec.begin(),vec.end()),vec.end());
	return vec;
}

vector<int> Iota(int n,int s=0){
	vector<int> res(n);
	iota(res.begin(),res.end(),s);
	return res;
}

vector<ll> Iotall(int n,ll s=0){
	vector<ll> res(n);
	iota(res.begin(),res.end(),s);
	return res;
}
void YESNO(bool f){
	if(f)cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
}

using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using vvvl=vector<vector<vector<ll>>>; 
using vi=vector<int>;
using vvi=vector<vector<int>>;
using vvvi=vector<vector<vector<int>>>;

struct Combination{
	
	Combination(int n){
		init(n);
	}
	Combination(){};
	private:
		int n;
		vector<mint> _fact,_factinv;
		void init(int n){
			this->n=n;
			_fact.resize(n+1,1);_factinv.resize(n+1,1);
			for(int i=0;i<n;i++)_fact[i+1]=_fact[i]*(i+1);
			_factinv[n]=_fact[n].inv();
			for(int i=n-1;i>=0;i--)_factinv[i]=_factinv[i+1]*(i+1);
		}
	public:
		mint fact(int x){
			return _fact[x];
		}
		mint factinv(int x){	
			return _factinv[x];
		}
		mint C(int x,int y){
			assert(0<=x&&x<=n&&0<=y);
			if(x<y)return 0;
			else return _fact[x]*_factinv[y]*_factinv[x-y];
		};
		mint Cinv(int x,int y){
			assert(0<=x&&x<=n&&0<=y);
			if(x<y)return 0;
			else return _factinv[x]*_fact[y]*_fact[x-y];
		}
		mint P(int x,int y){
			assert(0<=x&&x<=n&&0<=y);
			if(x<y)return 0; else return _fact[x]*_factinv[x-y];
		}
		mint Pinv(int x,int y){
			assert(0<=x&&x<=n&&0<=y);
			if(x<y)return 0;
			else return _factinv[x]*_fact[x-y];
		}
		// y/x
		mint frac(int y,int x){
			assert(x!=0);
			if(y==0)return 0;
			else return (_fact[y]*_factinv[y-1]*_factinv[x]*_fact[x-1]);
		}
};

Combination comb;

// \sum_{x=0}^{a-1}\binom{b}{x}
// (a,b)->(a-1,b)
void down_binomsum_a(int& a,int& b,mint& c){
	c-=comb.C(b,a-1);
}
//(a,b)->(a+1,b)
void up_binomsum_a(int& a,int& b,mint& c){
	c+=comb.C(b,a);
}
//(a,b)->(a,b-1)
void down_binomsum_b(int& a,int& b,mint& c){
	if(a!=0) c=(c+comb.C(b-1,a-1))*comb.frac(1,2);
}
//(a,b)->(a,b+1)
void up_binomsum_b(int& a,int& b,mint& c){
	if(a!=0) c=2*c-comb.C(b,a-1);
}
	
int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(10);
	comb=Combination(3000000);
	int n,q;
	cin>>n>>q;
	string s;
	cin>>s;
	set<int> ss;
	ss.insert(-1);
	int ng=0;
	mint ans=1;
	auto is_ng=[&](int i)->bool{
		if(i==n-1){
			return s[i-1]!=s[i];
		}
		bool res=false;
		if(s[i-1]==s[i+1]&&s[i-1]!=s[i])res=true;
		if(s[i-1]!=s[i+1]&&s[i-1]!=s[i])res=true;
		return res;
	};
	auto erase=[&](int i)->void{
		ss.erase(i);
		auto itr=ss.upper_bound(i);
		if(itr!=ss.end()){
			auto itr2=itr;
			itr2--;
			int len=(*itr)-(*itr2);
			len/=2;
			ans*=comb.C(2*len,len)*comb.frac(1,len+1);
			int len2=i-(*itr2),len3=(*itr)-i;
			len2/=2;
			len3/=2;
			ans*=comb.Cinv(2*len2,len2)*(len2+1);
			ans*=comb.Cinv(2*len3,len3)*(len3+1);
		}else{
			itr--;
			int len=i-(*itr);
			len/=2;
			ans*=comb.Cinv(2*len,len)*(len+1);
		}
	};
	auto add=[&](int i)->void{
		auto itr=ss.lower_bound(i);
		if(itr!=ss.end()){
			auto itr2=itr;
			itr2--;
			int len=(*itr)-(*itr2);
			len/=2;
			ans*=comb.Cinv(2*len,len)*(len+1);
			int len2=i-(*itr2),len3=(*itr)-i;
			len2/=2;
			len3/=2;
			ans*=comb.C(2*len2,len2)*comb.frac(1,len2+1);
			ans*=comb.C(2*len3,len3)*comb.frac(1,len3+1);
		}else{
			itr--;
			int len=i-(*itr);
			len/=2;
			ans*=comb.C(2*len,len)*comb.frac(1,len+1);
		}
		ss.insert(i);
	};

	for(int i=1;i<n;i+=2){
		if(is_ng(i))ng++;
		if(i<n-1&&s[i-1]!=s[i+1]&&s[i-1]==s[i])add(i);
	}
	while(q--){
		int cmd;
		cin>>cmd;
		if(cmd==1){
			int i;
			cin>>i;
			i--;
			if(i&1){
				if(is_ng(i))ng--;
				if(i<n-1&&s[i-1]!=s[i+1]&&s[i-1]==s[i])erase(i);
				s[i]=('Y'+'N')-s[i];
				if(is_ng(i))ng++;
				if(i<n-1&&s[i-1]!=s[i+1]&&s[i-1]==s[i])add(i);
			}else{
				for(int j=i-1;j<=i+1;j+=2){
					if(j<0||j>=n)continue;
					if(is_ng(j))ng--;
					if(j<n-1&&s[j-1]!=s[j+1]&&s[j-1]==s[j])erase(j);
				}
				s[i]=('Y'+'N')-s[i];
				for(int j=i-1;j<=i+1;j+=2){
					if(j<0||j>=n)continue;
					if(is_ng(j))ng++;
					if(j<n-1&&s[j-1]!=s[j+1]&&s[j-1]==s[j])add(j);
				}
			}
		}else{
			int k;
			cin>>k;
			if(n==1){
				if((s[0]=='Y')==(k==0))cout<<1<<endl;
				else cout<<0<<endl;
				continue;
			}
			k=n-k;
			/*
			cerr<<"ss:"<<endl;
			for(int x:ss)cerr<<x<<" ";
			cerr<<endl;
			cerr<<ans<<endl;
			cerr<<ng<<endl;
			//*/
			if(ng>0){
				cout<<0<<endl;
				continue;
			}
			if(n&1){
				if((k<(n+1)/2)!=(s[n-1]=='N')){
					cout<<0<<endl;
					continue;
				}
				int r=*ss.rbegin();
				int len=n-r-1;
				int h=(r+1)/2;
				if(h>k||k-h>len){
					cout<<0<<endl;
					continue;
				}
				mint res=comb.C(len,k-h);
				if(k>=(n+1)/2&&k-h+1<=len)res-=comb.C(len,k-h+1);
				if(k<=n/2&&0<=k-h-1&&k-h-1<=len)res-=comb.C(len,k-h-1);
				cout<<res*ans<<endl;
			}else{
				if(k!=n/2&&((k<n/2)!=(s[n-1]=='N'))){
					cout<<0<<endl;
					continue;
				}
				int r=*ss.rbegin();
				int len=n-r-1;
				int h=(r+1)/2;
				if(h>k||k-h>len){
					cout<<0<<endl;
					continue;
				}
				mint res=comb.C(len,k-h);
				if(k>=n/2&&k-h+1<=len)res-=comb.C(len,k-h+1);
				if(k<n/2&&0<=k-h-1&&k-h-1<=len)res-=comb.C(len,k-h-1);
				cout<<res*ans<<endl;
			}
		}
	}
}