#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))
#define sz(v) ((int) v.size())

using namespace std;

using i64 = long long;
using f80 = long double;
using vi32 = vector<int>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

void yes() { cout << "Yes" << endl; exit(0); }
void no() { cout << "No" << endl; exit(0); }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> void amax(T &x, T y) { x = max(x, y); }
template <typename T> void amin(T &x, T y) { x = min(x, y); }
template <typename T> T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }

const int INF = 1001001001;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};

template <int mod>
struct ModInt {
  int x;
  ModInt(): x(0) {}
  ModInt(long long a) { x = a % mod; if (x < 0) x += mod; }
  ModInt &operator+=(ModInt that) { x = (x + that.x) % mod; return *this; }
  ModInt &operator-=(ModInt that) { x = (x + mod - that.x) % mod; return *this; }
  ModInt &operator*=(ModInt that) { x = (long long) x * that.x % mod; return *this; }
  ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
  ModInt inverse() {
    int a = x, b = mod, u = 1, v = 0;
    while (b) { int t = a / b; a -= t * b; u -= t * v; swap(a, b); swap(u, v); }
    return ModInt(u);
  }
  #define op(o, p) ModInt operator o(ModInt that) { return ModInt(*this) p that; }
    op(+, +=) op(-, -=) op(*, *=) op(/, /=)
  #undef op
  friend ostream& operator<<(ostream &os, ModInt m) { return os << m.x; }
};

using mint = ModInt<998244353>;

template<
  typename T,
  typename U
>
static inline std::vector<U>
makeNdVector(T&& n, U&& val) noexcept
{
  static_assert(std::is_integral<T>::value, "[makeNdVector] The 1st argument must be an integer");
  return std::vector<U>(std::forward<T>(n), std::forward<U>(val));
}
 
 
template<
  typename T,
  typename... Args
>
static inline decltype(auto)
makeNdVector(T&& n, Args&&... args) noexcept
{
  static_assert(std::is_integral<T>::value, "[makeNdVector] The 1st argument must be an integer");
  return std::vector<decltype(makeNdVector(std::forward<Args>(args)...))>(std::forward<T>(n), makeNdVector(std::forward<Args>(args)...));
}
 
 
template<
  typename T,
  std::size_t N,
  typename std::enable_if<(N > 0), std::nullptr_t>::type = nullptr
>
struct ndvector_impl
{
  using type = std::vector<typename ndvector_impl<T, N - 1>::type>;
};  // struct ndvector_impl
 
 
template<typename T>
struct ndvector_impl<T, 1>
{
  using type = std::vector<T>;
};  // struct ndvector_impl
 
 
template<
  typename T,
  std::size_t N
>
using NdVector = typename ndvector_impl<T, N>::type;

void solve() {
  string S;
  int K;
  cin >> S >> K;
  amin(K, 300);
  vi32 v;
  int cnt = 0;
  {
    int c = 0; 
    rep(i, sz(S)) {
      if (S[i] == '1') {
        c += 1;
        cnt += 1;
      } else {
        v.push_back(c);
        c = 0;
      }
    }
    v.push_back(c);
  }
  int n = sz(v);
  vi32 sums(n + 1);
  rrep(i, n) {
    sums[i] = sums[i + 1] + v[i];
  }
  auto dp = makeNdVector(n + 1, sums[0] + 1, K + 1, (mint) 0);
  dp[0][sums[0]][0] = 1;
  rep(i, n) repc(j, sums[i]) repc(k, K) repc(l, j) {
    int ni = i + 1;
    int nj = j - l;
    if (nj > sums[i + 1]) continue;
    int nk = k + max(v[i] - l, 0);
    if (nk > K) continue;
    dp[ni][nj][nk] += dp[i][j][k];
  }
  mint ans = 0;
  repc(k, K) ans += dp[n][0][k];
  cout << ans << endl;
}


Measured memory_bytes: 30996