#include <bits/stdc++.h>

using namespace std;

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldbl;
typedef pair<int, int> pii;
typedef pair<uint, uint> puu;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<uint> vu;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<pii> vpii;
typedef vector<puu> vpuu;
typedef vector<pll> vpll;
typedef vector<pull> vpull;
typedef vector<string> vstr;
typedef vector<double> vdbl;
typedef vector<ldbl> vldbl;
#define pb push_back
#define ppb pop_back
#define pfr push_front
#define ppfr pop_front
#define emp emplace
#define empb emplace_back
#define be begin
#define rbe rbegin
#define all(x) (x).be(), (x).end()
#define rall(x) (x).rbe(), (x).rend()
#define fir first
#define sec second
#define mkp make_pair
#define brif(cond) if (cond) break
#define ctif(cond) if (cond) continue
#define retif(cond) if (cond) return
void canhazfast() {ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);}
template<typename T> T gcd(T a, T b) {return b ? gcd(b, a%b) : a;}
template<typename T> T extgcd(T a, T b, T &x, T &y)
{
    T x0 = 1, y0 = 0, x1 = 0, y1 = 1;
    while (b) {
        T q = a/b; a %= b; swap(a, b);
        x0 -= q*x1; swap(x0, x1);
        y0 -= q*y1; swap(y0, y1);
    }
    x = x0; y = y0; return a;
}
int ctz(uint x) {return __builtin_ctz(x);}
int ctzll(ull x) {return __builtin_ctzll(x);}
int clz(uint x) {return __builtin_clz(x);}
int clzll(ull x) {return __builtin_clzll(x);}
int popcnt(uint x) {return __builtin_popcount(x);}
int popcntll(ull x) {return __builtin_popcountll(x);}
int bsr(uint x) {return 31^clz(x);}
int bsrll(ull x) {return 63^clzll(x);}

#define MOD 998244353

uint add(uint a, uint b) { return a+b < MOD ? a+b : a+b-MOD; }
uint sub(uint a, uint b) { return a < b ? a+MOD-b : a-b; }
uint mul(uint a, uint b) { return (ull)a*b%MOD; }
uint sqr(uint a) { return mul(a, a); }

uint modpow(uint b, uint e)
{
    uint r = 1;
    for (; e; e >>= 1) {
        if (e&1) r = mul(r, b);
        b = sqr(b);
    }
    return r;
}

uint modpowll(uint b, ull e)
{
    uint r = 1;
    for (; e; e >>= 1) {
        if (e&1) r = mul(r, b);
        b = sqr(b);
    }
    return r;
}

uint modinv(uint n) { return modpow(n, MOD-2); }
uint moddiv(uint n, uint d) { return mul(n, modinv(d)); }

void uadd(uint &a, uint b) { a = add(a, b); }
void usub(uint &a, uint b) { a = sub(a, b); }

#define N 320

char s[N];
int x[N];
uint dp[N][N][N];

int main()
{
    canhazfast();

    int n, k, m = 0;
    int sx = 0, suf = 0, cnt = 0;
    uint ans = 0;

    cin >> s >> k;
    n = strlen(s);
    for (int i = 0; i < n; ++i) {
        int d = s[i]-'0';
        sx += d;
        cnt += d;
        if (d == 0) {
            x[m++] = cnt;
            cnt = 0;
        }
    }
    k = min(k, sx);
    x[m++] = cnt;
    while (m && x[m-1] == 0) --m;

    dp[m][0][0] = 1;
    for (int i = m-1; i >= 0; --i) {
        suf += x[i];
        for (int j = 0; j <= k; ++j) {
            for (int c = 0; c <= suf; ++c) {
                /// nop
                dp[i][j][c] = dp[i+1][j][c];
                /// dec
                int dec_mx = min(min(j, c), x[i]);
                for (int d = 1; d <= dec_mx; ++d) uadd(dp[i][j][c], dp[i+1][j-d][c-d]);
                /// inc
                int inc_mx = suf-x[i]-c;
                for (int d = 1; d <= inc_mx; ++d) uadd(dp[i][j][c], dp[i+1][j][c+d]);
            }
        }
    }
    for (int i = 0; i <= k; ++i) uadd(ans, dp[0][i][0]);
    cout << ans << '\n';

    return 0;
}


Measured memory_bytes: 31848