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
// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,bmi,bmi2,lzcnt,abm,mmx,avx,avx2,tune=native")

#include <bits/stdc++.h>

using namespace std;

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

// template <typename T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define rep(i, j) for (int i = 0; i < ((int)(j)); i++)
#define pb push_back
#define pf push_front
#define st first
#define nd second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define get_unique(x) x.erase(unique(all(x)), x.end());

const int N = 10'000;

int pref1[N], pref2[N], pref3[N];

void TEST([[maybe_unused]] int testcase_i) {
  int n, k, t;
  cin >> n >> k >> t;

  string s;
  cin >> s;

  rep(i, n) {
    if (s[i] == '1') {
      pref1[i + 1] = 1;
    }
    if (s[i] == '2') {
      pref2[i + 1] = 1;
    }
    if (s[i] == '3') {
      pref3[i + 1] = 1;
    }
    pref1[i + 1] += pref1[i];
    pref2[i + 1] += pref2[i];
    pref3[i + 1] += pref3[i];
  }

  int ans = -1;
  if (pref1[n] <= k)
    ans = pref3[n] + pref1[n] + min(pref2[n], k - pref1[n]);

  for (int l = 0; l < n; l++) {
    for (int r = l + t; r + t - 1 < n; r++) {
      int miss_l = pref1[l + t] - pref1[l] + pref2[l + t] - pref2[l];
      int miss_r = pref1[r + t] - pref1[r] + pref2[r + t] - pref2[r];
      int miss_oth = pref1[l] + pref1[n] - pref1[r + t];

      int miss_tot = miss_l + miss_r + miss_oth;
      if (miss_tot > k)
        continue;

      int can_miss = pref2[l] + pref2[n] - pref2[r + t];
      int free_time = pref3[l] + pref3[n] - pref3[r + t];
      ans = max(ans, free_time + miss_oth + min(can_miss, k - miss_tot));
    }
  }

  cout << ans;
}

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

  // cout << setprecision(20) << fixed;

  // srand(time(NULL));

  // freopen("sorting.in", "r", stdin);
  // freopen("sorting.out", "w", stdout);

  int t = 1;
  // cin >> t;
  rep(i, t) {
    TEST(i);
  }

  return 0;
}