#include<cstdio>
#include<cstring>
#include<algorithm>
#define P 998244353
#define N 305

char s[N];
int n,m;

int cnt[N];

int dp[N][N][N<<1],s1[N][N<<1],s2[N][N<<1],ans;

int main(){
	scanf("%s%d",s+1,&m);
	n=strlen(s+1);
	m=std::min(m,n)<<1;
	for(int i=1,tmp=0;i<=n;i++)
		if(s[i]=='0')
			tmp++;
		else
			cnt[tmp+1]++;
	dp[0][0][0]=1;
	for(int j=0;j<=n&&j<=m;j++)
		s1[j+1][j+1]=1;
	s2[1][1]=1; 
	for(int i=1;i<=n+1;i++){
		for(int j=0;j<=n;j++)
			for(int k=0;k<=m;k++){
				dp[i][j][k]=(dp[i][j][k]+s1[j+1][k+1])%P;
				int x=std::min(std::min(n-j,k),cnt[i]);
				if(x)
					dp[i][j][k]=((dp[i][j][k]+s2[j+2][k])%P+P-s2[j+2+x][k-x])%P;
			}
		for(int j=0;j<=n;j++)
			for(int k=0;k<=m;k++)
				s1[j+1][k+1]=(s1[j][k]+dp[i][j][k])%P;
		for(int j=n;j>=0;j--)
			for(int k=0;k<=m;k++)
				s2[j+1][k+1]=(s2[j+2][k]+dp[i][j][k])%P;
	}
	for(int k=0;k<=m;k++)
		ans=(ans+dp[n+1][0][k])%P;
	printf("%d",ans);
}