#include //#pragma GCC optimize("O3") // optimization //#pragma GCC optimize("Ofast") // optimization //#pragma GCC optimize("unroll-loops") // optimization using namespace std; #define i32 signed #define int long long // CP #define i64 long long #define endl '\n' #define elif else if #define fi first #define se second #define pb push_back #define p32 pair #define p64 pair #define f2(i,x) for((i)=0;(i)<(x);(i)++) #define f2b(i,x) for((i)=(x)-1;(i)>=0;(i)--) #define f3(i,f,t) for((i)=(f);(i)<(t);(i)++) #define fall(x) (x).begin(), (x).end() #define sort1(x) sort(fall(x)) #define rev(x) reverse(fall(x)) #define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0) #define fl fflush(stdout) #define nl cout<>=1;}return r%m;} i64 expm(i64 a, i64 b){i64 r=1,m=1e9+7;while(b){if(b&1)r=r*a%m;a=a*a%m;b>>=1;}return r%m;} i64 minv(i64 a, i64 m){return expm(a,m-2,m);} i64 ncrm(i64 n, i64 r, i64 m){i64 i,j,k; i64 out=1; f3(i,1,n+1){out*=i;out%=m;}f3(i,1,r+1){out*=minv(i,m);out%=m;}f3(i,1,n-r+1){out*=minv(i,m);out%=m;}return out%m;} int n,m,k,a[300010],b[300010]; char c[300010]; int fac[300010],inv[300010]; int ncr(int n, int r){ if(n>n>>m; vectors(n); f2(i,n)cin>>s[i]; fac[0]=1; f3(i,1,300010)fac[i]=fac[i-1]*i%998244353; f2(i,300010)inv[i]=minv(fac[i],998244353); f2(i,n)f2(j,m){ if(s[i][j]=='B') a[(i+j)%3]++; elif(s[i][j]=='?') b[(i+j)%3]++; } int odd[3]={0,0,0},even[3]={0,0,0}; f2(i,3){ if(b[i]==0){ if(a[i]%2==0) even[i]=1; else odd[i]=1; } else odd[i]=even[i]=expm(2,b[i]-1,998244353); } cout<<(odd[0]*odd[1]%998244353*odd[2]%998244353+even[0]*even[1]%998244353*even[2]%998244353)%998244353<>tc; // while(tc--)f(); f(); return 0; }