1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
#include<bits/stdc++.h>
 
#define pb push_back
#define pob pop_back
#define eb emplace_back
#define fi first
#define se second
#define turbo ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mid ((l+r)/2)
#define midLL ((l+r)/2LL)
#define mide ((lo+hi)/2)
#define mideLL ((lo+hi)/2LL)
#define endl '\n'
#define random_shuffle shandom_ruffle
#define lowbit(x) x&(-x)
#define bits(x) __builtin_popcount(x) 
#define mins(se) (*se.begin())
#define maxs(se) (*--se.end())
#define all(x) x.begin(), x.end()
#define log2_floor(i) (i ? __builtin_clzll(1) - __builtin_clzll(i) : -1)
#define siz(cont) ((int)cont.size())
#define each(it, cont) for(auto &it : cont)

using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using pli = std::pair<ll, int>;
using pil = std::pair<int, ll>;
using vll = std::vector<pll>;
using vii = std::vector<pii>;
using vi = std::vector<int>;
using vl = std::vector<ll>;
using vvl = std::vector<vl>;
using vvi = std::vector<vi>;
using vvii = std::vector<vii>;
using vli = std::vector<pli>;
using vvli = std::vector<vli>;
using vil = std::vector<pil>;
using vvil = std::vector<vil>;
using vc = std::vector<char>;
using vs = std::vector<std::string>;
using vvc = std::vector<std::vector<char>>;
using vb = std::vector<bool>;
using vvb = std::vector<vb>;
using ld = long double;

void err() { std::cout << "\n"; fflush(stdout); }
template<class T, class... Ts>
void err(T arg, Ts &... args) {
    std::cout << arg << ' ';
    err(args...);
}

using namespace std;

vi pre, suf;

int pr(int x) {
    return (x < 0 ? 0 : pre[x]);
}

int sf(int x) {
    return (x < 0 ? 0 : suf[x]);
}


int main() {
    turbo;
    int n, k, t; cin >> n >> k >> t;
    vi v(n);
    pre = suf = vi(n+10);

    int all = 0;

    each(it, v) {
        char c; cin >> c;
        it = c-'0';
        if (it != 3)
            all++;
    }
    for (int i = 0; i <= n; i++) {
        if (v[i] == 2)
            pre[i]++;
        pre[i+1] = pre[i];
    }
    for (int i = n-1; i >= 0; i--) {
        if (v[i] == 2)
            suf[i]++;
        suf[i] += suf[i+1];
    }

    if (all - pre[n] <= k) {
        cout << n - all + min(all, k) << endl;
        return 0;
    }

    int best = -1;
    int rq = max(0, all-k);

    for (int i = t; i < n-t; i++) {
        int in = 0;

        for (int j = i; j <= n-t; j++) {
            int av = in + pr(i-t-1) + sf(j+t);
            if (av >= rq) {
                int nbest = n - 2*t - (j-i) - max(0, rq - in);
                best = max(best, nbest);
            }
            if (v[j] != 3)
                in++;
        }
    }
    cout << best << endl;
}