#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 998244353;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

const int N = 3e2 + 10;
char s[N];
vector<int> a;
int pre[N];
int dp[N][N][N];
int n;

int solve(int pos, int rem, int acc) {
  if (pos == n) {
    return acc == 0;
  }
  int& ret = dp[pos][rem][acc];
  if (ret >= 0) return ret;
  ret = 0;
  for (int k = 0; k <= a[pos] && k <= rem; ++k) {
    ret += solve(pos + 1, rem - k, acc + k);
    ret %= MOD;
  }
  for (int k = 1; k <= acc; ++k) {
    ret += solve(pos + 1, rem, acc - k);
    ret %= MOD;
  }
  return ret;
}

int main() {
  int m;
  scanf("%s%d", s, &m);
  n = strlen(s);
  int cnt = 0;
  for (int i = 0; i < n; ++i) {
    if (s[i] == '0') {
      a.push_back(cnt);
      cnt = 0;
    } else {
      ++cnt;
    }
  }
  if (cnt) a.push_back(cnt);
  reverse(a.begin(), a.end());
  // trace(a);
  n = a.size();
  for (int i = 0; i < n; ++i) {
    pre[i + 1] = pre[i] + a[i];
  }
  m = min(m, pre[n]);
  memset(dp, 255, sizeof(dp));
  int ret = solve(0, m, 0);
  printf("%d\n", ret);
  return 0;
}


Measured memory_bytes: 119612