#include <bits/stdc++.h>
#include <unistd.h>
#include <sys/time.h>
#include <stdlib.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<long double , ll> Ps;
typedef pair<ll, bool> Pb;

const ll INF = 1e18;
const ll fact_table = 3200008;
long double Pi = 3.1415926535897932384626;

priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <P> bag;
//big priority queue
priority_queue <ll, vector<ll>, greater<ll> > pqls;
priority_queue <P, vector<P>, greater<P> > pqps;
//small priority queue
//top pop

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
char dir[] = "DRUL";
//↓,→,↑,←

/*
#define endl "\n"
#ifdef ENJAPMA
#undef endl
#endif
*/
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)();
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i ++)

const ll mod = 998244353ll;
// const ll mod = 1000000007ll;

ll mypow(ll a, ll b, ll mod) {ll x = 1; while (b) {while (!(b & 1)) {(a *= a) %= mod; b >>= 1;}(x *= a) %= mod; b--;} return x;}
void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;}
void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;}
void line() { p("--------------------"); return;}

/*
ll fact[fact_table + 5],rfact[fact_table + 5];

void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table],mod - 2, mod);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}
*/

bool multicase = false;

ll n, m, k, num, a, b, c, d, e, h, q, ans, sum;

typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

string s, t;
ll dp[305][305][305];

void solve() {
    ll K;
    cin >> s >> K;
    n = s.size();
    ll cnt = 0;
    vector<ll> v;
    for(ll i=0;i<n;i++){
        if(s[i] == '0'){
            v.pb(cnt);
            cnt = 0;
        }else{
            cnt ++;
        }
    }
    v.pb(cnt);
    cnt = 0;
    m = v.size();
    dp[0][0][0] = 1;
    ll maxi = 0;
    ll sum = 0;
    for(auto u : v){
        maxi = max(maxi, u);
        sum += u;
    }
    K = min(K, sum);
    for(ll i=1;i<=m;i++){
        for(ll j=0;j<=n;j++){
            // if use j ?
            for(ll k=0;k<=K;k++){
                for(ll l=0;l<=k;l++){
                    ll my_use = j;
                    ll norm = v[i-1];
                    ll nx, ny;
                    if (my_use >= norm) {
                        nx = k + my_use - norm;
                        ny = l;
                    } else {
                        nx = k;
                        ny = l + norm - my_use;
                    }
                    if (nx <= K && ny <= K && nx >= ny) dp[i][nx][ny] += dp[i-1][k][l];
                    dp[i][nx][ny] %= mod;
                }
            }
        }
    }
    ll ans = 0;
    for(ll i=0;i<=K;i++){
        ans += dp[m][i][i];
        ans %= mod;
    }
    p(ans);
    return;
}

int main() {
    // init();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll q, testcase = 1;
    if (multicase) {
        cin >> q;
    } else {
        q = 1;
    }
    while (q--) {
        // pu("Case ");pu("#");pu(testcase);pu(": ");
        solve();
        testcase++;
    }
    // solve();
    return 0;
}



Measured memory_bytes: 218520