// IOI 2021
#include <bits/stdc++.h>
using namespace std;
 
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const ll MOD = 998244353;
 
////////////////////////////////////////////////////////////////////
 
const int N = 3e2 + 5;

int A[N], DP[N][N][N];

void Add(int &x, int y) {
	x += y;
	if (x >= MOD) x -= MOD;
}

int main() {
 
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	mt19937 Rnd(time(0));

	string S; cin >> S;
	int m = 1, o = 0;
	for (char c : S) if (c == '0') m++; else A[m - 1]++, o++;
	reverse(A, A + m);
	DP[0][0][0] = 1;
	for (int i = 0; i < m; i++) for (int j = 0; j <= o; j++) for (int k = 0; k <= o; k++) {
		if (!DP[i][j][k]) continue;
		for (int l = 0; l <= A[i] + k; l++) Add(DP[i + 1][j + max(A[i] - l, 0)][k + A[i] - l], DP[i][j][k]);
	}
	int k; cin >> k;
	k = min(k, o);
	int ans = 0;
	for (int i = 0; i <= k; i++) Add(ans, DP[m][i][0]);
	cout << ans << endl;

	return 0;
}

#ifndef Local
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx")
#endif

#include <bits/stdc++.h>

using namespace std;

#define popCnt(x) (__builtin_popcountll(x))
#define sz(x) ((int)(x.size()))
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
typedef long long Long;
typedef double Double;

template <class U, class V>
istream& operator>>(istream& is, pair<U, V>& p) {
  is >> p.first >> p.second;
  return is;
}
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
  for (auto& x : v) {
    is >> x;
  }
  return is;
}

template <class T>
ostream& operator<<(ostream& os, vector<T>& v) {
  for (auto& x : v) {
    os << x << " ";
  }
  return os;
}

const int N = 303;
const int MOD = 998244353;
int memo[N][N][N];

vector<int> v;
int count(int ind, int ones, int k) {
  if (k < 0) return 0;
  if (ones < 0) return 0;
  if (ind == 0) return 1;
  int& res = memo[ind][ones][k];
  if (res != -1) return res;
  res = 0;
  for (int i = 0; i <= v[ind] + ones; ++i) {
    res =
        (res + count(ind - 1, v[ind] + ones - i, k - max(0, v[ind] - i))) % MOD;
  }
  return res;
}

int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#ifdef Local
  freopen("test.in", "r", stdin);
#else
#define endl '\n'
#endif

  string s;
  int k;
  cin >> s >> k;

  memset(memo, -1, sizeof memo);
  v.emplace_back(0);
  for (int i = 0; i < s.size(); ++i) {
    if (s[i] == '1') {
      ++v.back();
    } else {
      v.emplace_back(0);
    }
  }

  cout << count(sz(v) - 1, 0, min(N - 1, k)) << endl;

  return 0;
}