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
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pii;

#define FOR(x, b, e) for(int x = (b); x <= (e); ++(x))
#define FORD(x, b, e) for(int x = (b); x >= (e); --(x))
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(a, b) for (auto&a : (b))
#define PB push_back
#define PF push_front
#define ST first
#define ND second
#define DBG(vari) cerr<<#vari<<" = "<<(vari)<<endl

template <typename T>
std::ostream& operator<<(std::ostream &output, const vector<T> &vec)
{
    output << "[";
    FOREACH(x, vec) output << x << ", ";
    output << "]";
    return output;
}

template <typename T, typename U>
std::ostream& operator<<(std::ostream &output, const pair<T,U> &p)
{
    output << "(";
    output << p.ST << ", " << p.ND;
    output << ")";
    return output;
}


int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int n, k, t; cin >> n >> k >> t;
  string s; cin >> s;

  int wyn = -1;

  vi sb(n+1, 0), sz(n+1, 0), bez(n+1, 0);
  FOR(i, 1, n) {
    sb[i] = sb[i-1] + (int)(s[i-1] == '1');
    sz[i] = sz[i-1] + (int)(s[i-1] == '2');
    bez[i] = bez[i-1] + (int)(s[i-1] == '3');
  }

  // nie wychodzi z domu
  if (sb[n] <= k) {
    wyn = sb[n] + bez[n] + min(k - sb[n], sz[n]);
  }
  else
  {
    // jedzie do biura
    REP(a, n) {
      FOR(b, a + 2 * t - 1, n-1) {
        int skipped = (sz[b+1] - sz[a]) - (sz[b-t+1] - sz[a+t]) + sb[a+t] + (sb[n] - sb[b-t+1]); 
        if (skipped <= k) {
          int skipped2 = min(k - skipped, (sz[n] - sz[b+1]) + sz[a]);
          wyn = max(wyn, (sb[n]-sb[b+1])+sb[a] + (bez[n]-bez[b+1])+bez[a] + skipped2);
        }
      }
    }
  }

  cout << wyn << endl;
}