求条马蜂优良，样例没过

#include<bits/stdc++.h>
using namespace std;
int n,m;
const int N=5e2+5,mod=998244353;
string s;
int c[N];
int dp[N][N][N];
int C[N][N];
int jc[N];
int t[N];
int ss[N];
int mul(int x,int y){
	return (1ll*x*y)%mod;
}
int main(){
	// freopen("employ.in","r",stdin);
	// freopen("employ.out","w",stdout);
	cin>>n>>m>>s;
	jc[0]=1;
	for(int i=1;i<=n;i++)jc[i]=(jc[i-1]*i)%mod;
	C[0][0]=1;
	for(int i=1;i<=n;i++){
		C[i][0]=1;
		for(int j=1;j<=i;j++)C[i][j]=(C[i-1][j]+C[i-1][j-1])%mod;
	}
	s=' '+s;
	for(int i=1;i<=n;i++){
		cin>>c[i];t[c[i]]++;
	}
	ss[0]=c[0];
	for(int i=1;i<=n;i++)ss[i]=(ss[i-1]+t[i]);
	dp[0][0][0]=1;
	for(int i=0;i<n;i++){
		for(int j=0;j<=i;j++){
			for(int k=0;k<=i;k++){
				if(s[i+1]=='1'){
//					cout<<c[i+1]<<" "<<j<<" "<<k<<endl;
					if(c[i+1]>j)dp[i+1][j][k+1]=(dp[i+1][j][k+1]+dp[i][j][k])%mod;
					else for(int o=0;o<=t[j+1];o++){
						dp[i+1][j+1][k-o]=(dp[i+1][j+1][k-o]+(mul(C[k][o],mul(C[t[j+1]][o],mul(jc[o],mul(dp[i][j][k],(ss[j]-(i-k)-o))))))%mod)%mod;
//						cout<<i<<" "<<j<<" "<<k<<" "<<C[k][o]<<" "<<C[t[j+1]][o]<<" "<<jc[o]<<" "<<dp[i][j][k]<<" "<<ss[j]-(i-k)-o<<" "<<" "<<mul(C[k][o],mul(C[t[j+1]][o],mul(jc[o],mul(dp[i][j][k],(ss[j]-(i-k)-o)))))<<endl;
					}
				}else{
					if(c[i+1]>j)for(int o=0;o<=t[j+1];o++)dp[i+1][j+1][k+1-o]=(dp[i+1][j+1][k-o+1]+(mul(C[k][o],mul(C[t[j+1]][o],mul(jc[o],mul(dp[i][j][k],1))))));
					else for(int o=0;o<=t[j+1];o++)dp[i+1][j+1][k-o]=(dp[i+1][j+1][k-o]+(mul(C[k][o],mul(C[t[j+1]][o],mul(jc[o],mul(dp[i][j][k],(ss[j]-(i-k)-o))))))%mod)%mod;
				}
			}
		}
	}
	int ans=0;
	for(int i=0;i<=n-m;i++)ans=(ans+mul(dp[n][i][n-ss[i]],jc[n-ss[i]]))%mod;
	cout<<ans;
	return 0;
}