#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define MD (998244353U)
template<class S, class T> inline S min_L(S a,T b){
  return a<=b?a:b;
}
struct Modint{
  unsigned val;
  Modint(){
    val=0;
  }
  Modint(int a){
    val = ord(a);
  }
  Modint(unsigned a){
    val = ord(a);
  }
  Modint(long long a){
    val = ord(a);
  }
  Modint(unsigned long long a){
    val = ord(a);
  }
  inline unsigned ord(unsigned a){
    return a%MD;
  }
  inline unsigned ord(int a){
    a %= (int)MD;
    if(a < 0){
      a += MD;
    }
    return a;
  }
  inline unsigned ord(unsigned long long a){
    return a%MD;
  }
  inline unsigned ord(long long a){
    a %= (int)MD;
    if(a < 0){
      a += MD;
    }
    return a;
  }
  inline unsigned get(){
    return val;
  }
  inline Modint &operator+=(Modint a){
    val += a.val;
    if(val >= MD){
      val -= MD;
    }
    return *this;
  }
  inline Modint &operator-=(Modint a){
    if(val < a.val){
      val = val + MD - a.val;
    }
    else{
      val -= a.val;
    }
    return *this;
  }
  inline Modint &operator*=(Modint a){
    val = ((unsigned long long)val*a.val)%MD;
    return *this;
  }
  inline Modint &operator/=(Modint a){
    return *this *= a.inverse();
  }
  inline Modint operator+(Modint a){
    return Modint(*this)+=a;
  }
  inline Modint operator-(Modint a){
    return Modint(*this)-=a;
  }
  inline Modint operator*(Modint a){
    return Modint(*this)*=a;
  }
  inline Modint operator/(Modint a){
    return Modint(*this)/=a;
  }
  inline Modint operator+(int a){
    return Modint(*this)+=Modint(a);
  }
  inline Modint operator-(int a){
    return Modint(*this)-=Modint(a);
  }
  inline Modint operator*(int a){
    return Modint(*this)*=Modint(a);
  }
  inline Modint operator/(int a){
    return Modint(*this)/=Modint(a);
  }
  inline Modint operator+(long long a){
    return Modint(*this)+=Modint(a);
  }
  inline Modint operator-(long long a){
    return Modint(*this)-=Modint(a);
  }
  inline Modint operator*(long long a){
    return Modint(*this)*=Modint(a);
  }
  inline Modint operator/(long long a){
    return Modint(*this)/=Modint(a);
  }
  inline Modint operator-(void){
    Modint res;
    if(val){
      res.val=MD-val;
    }
    else{
      res.val=0;
    }
    return res;
  }
  inline operator bool(void){
    return val!=0;
  }
  inline operator int(void){
    return get();
  }
  inline operator long long(void){
    return get();
  }
  inline Modint inverse(){
    int a = val;
    int b = MD;
    int u = 1;
    int v = 0;
    int t;
    Modint res;
    while(b){
      t = a / b;
      a -= t * b;
      swap(a, b);
      u -= t * v;
      swap(u, v);
    }
    if(u < 0){
      u += MD;
    }
    res.val = u;
    return res;
  }
  inline Modint pw(unsigned long long b){
    Modint a(*this);
    Modint res;
    res.val = 1;
    while(b){
      if(b&1){
        res *= a;
      }
      b >>= 1;
      a *= a;
    }
    return res;
  }
  inline bool operator==(int a){
    return ord(a)==val;
  }
  inline bool operator!=(int a){
    return ord(a)!=val;
  }
}
;
inline Modint operator+(int a, Modint b){
  return Modint(a)+=b;
}
inline Modint operator-(int a, Modint b){
  return Modint(a)-=b;
}
inline Modint operator*(int a, Modint b){
  return Modint(a)*=b;
}
inline Modint operator/(int a, Modint b){
  return Modint(a)/=b;
}
inline Modint operator+(long long a, Modint b){
  return Modint(a)+=b;
}
inline Modint operator-(long long a, Modint b){
  return Modint(a)-=b;
}
inline Modint operator*(long long a, Modint b){
  return Modint(a)*=b;
}
inline Modint operator/(long long a, Modint b){
  return Modint(a)/=b;
}
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(char &c){
  int i;
  for(;;){
    i = my_getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c = i;
}
inline int rd(char c[]){
  int i;
  int sz = 0;
  for(;;){
    i = my_getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c[sz++] = i;
  for(;;){
    i = my_getchar_unlocked();
    if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF){
      break;
    }
    c[sz++] = i;
  }
  c[sz]='\0';
  return sz;
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
inline void wt_L(Modint x){
  int i;
  i = (int)x;
  wt_L(i);
}
template<class S, class T> inline S chmin(S &a, T b){
  if(a>b){
    a=b;
  }
  return a;
}
int N;
int K;
char S[303];
int sz;
int arr[303];
Modint dp[301][301];
Modint sm[301][301];
Modint nx[301][301];
int main(){
  int i;
  int j;
  int k;
  int m;
  int cnt = 0;
  Modint res = 0;
  Modint tmp;
  N = rd(S);
  rd(K);
  for(i=(0);i<(N);i++){
    if(S[i]=='0'){
      arr[sz++] = cnt;
      cnt = 0;
    }
    else{
      cnt++;
    }
  }
  if(cnt){
    arr[sz++] = cnt;
  }
  {
    int Q5VJL1cS;
    int e98WHCEY;
    if(sz==0){
      e98WHCEY = 0;
    }
    else{
      e98WHCEY = arr[0];
      for(Q5VJL1cS=(1);Q5VJL1cS<(sz);Q5VJL1cS++){
        e98WHCEY += arr[Q5VJL1cS];
      }
    }
    chmin(K, e98WHCEY);
  }
  dp[K][0] = 1;
  for(k=(sz)-1;k>=(0);k--){
    for(i=(0);i<(K+1);i++){
      for(j=(0);j<(K+1);j++){
        nx[i][j] = 0;
      }
    }
    for(i=(0);i<(K+1);i++){
      tmp = 0;
      for(j=(K+1)-1;j>=(0);j--){
        nx[i][j] += tmp;
        tmp += dp[i][j];
      }
    }
    for(i=(K+1)-1;i>=(0);i--){
      for(j=(0);j<(K+1);j++){
        sm[i][j] = dp[i][j];
        if(i+1 <= K && j-1 >= 0){
          sm[i][j] += sm[i+1][j-1];
        }
      }
    }
    for(i=(0);i<(K+1);i++){
      for(j=(0);j<(K+1);j++){
        m =min_L(K + 1, i + arr[k] + 1);
        nx[i][j] += sm[i][j];
        if(m <= K && j-(m-i) >= 0){
          nx[i][j] -= sm[m][j-(m-i)];
        }
      }
    }
    for(i=(0);i<(K+1);i++){
      for(j=(0);j<(K+1);j++){
        dp[i][j] = nx[i][j];
      }
    }
  }
  for(i=(0);i<(K+1);i++){
    res += dp[i][0];
  }
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay varsion 20200509-1

// --- original code ---
// #define MD 998244353
// int N, K;
// char S[303];
// int sz, arr[303];
// Modint dp[301][301], sm[301][301], nx[301][301];
// {
//   int i, j, k, m, cnt = 0;
//   Modint res = 0, tmp;
//   rd(S@N,K);
// 
//   rep(i,N){
//     if(S[i]=='0'){
//       arr[sz++] = cnt;
//       cnt = 0;
//     } else {
//       cnt++;
//     }
//   }
//   if(cnt) arr[sz++] = cnt;
// 
//   K <?= sum(arr(sz));
//   dp[K][0] = 1;
//   rrep(k,sz){
//     rep(i,K+1) rep(j,K+1) nx[i][j] = 0;
// 
//     rep(i,K+1){
//       tmp = 0;
//       rrep(j,K+1){
//         nx[i][j] += tmp;
//         tmp += dp[i][j];
//       }
//     }
// 
//     rrep(i,K+1) rep(j,K+1){
//       sm[i][j] = dp[i][j];
//       if(i+1 <= K && j-1 >= 0) sm[i][j] += sm[i+1][j-1];
//     }
// 
//     rep(i,K+1) rep(j,K+1){
//       m = min(K + 1, i + arr[k] + 1);
//       nx[i][j] += sm[i][j];
//       if(m <= K && j-(m-i) >= 0) nx[i][j] -= sm[m][j-(m-i)];
//     }
// 
//     rep(i,K+1) rep(j,K+1) dp[i][j] = nx[i][j];
//   }
//   rep(i,K+1) res += dp[i][0];
//   wt(res);
// }


Measured memory_bytes: 4700