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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define __builtin_ctz __builtin_ctzll
#define __builtin_clz __builtin_clzll
#define __builtin_popcount __builtin_popcountll
using namespace std;
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
  template<class T> void ResizeVec(T&, vector<int>) {}
  template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
    vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
    for (T& v : vec) { ResizeVec(v, sz); }
  }
  typedef Triple<int, int, int> TIII;
  template<class A, class B, class C>
  ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
  template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
  template<class T> ostream& operator<<(ostream& out, set<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
  template<class L, class R> ostream& operator<<(ostream& out, map<L, R> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
  
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',') { cerr<<*sdbg++; } cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<pair<int, int> > VPII;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//mt19937 rng(57);


struct Sol {
  void Test() {
    int n, k, t;
    cin>>n>>k>>t;
    vector<char> type(n + 2);
    vector<int> pref1(n + 1);
    vector<int> pref12(n + 1);
    vector<int> pref3(n + 1);
    RE (i, n) {
      cin>>type[i];
      pref1[i] = pref1[i - 1] + (type[i] == '1');
      pref12[i] = pref12[i - 1] + (type[i] == '1' || type[i] == '2');
      pref3[i] = pref3[i - 1] + (type[i] == '3');
    }
    int base = -1;
    if (pref1[n] <= k) {
      base = min(n, n - pref12[n] + k);
    }
    function<int(VI&, int, int)> Get = [&](VI& v, int a, int b) {
      assert(a <= b);
      return v[b] - v[a];
    };
    //debug(base);
    RE (i2, n - t) {
      REP (i1, i2 - t + 1) {
        int forced_omitted = Get(pref1, 0, i1) + Get(pref1, i2 + t, n) + Get(pref12, i1, i1 + t) + Get(pref12, i2, i2 + t);
        //pref1[n] - pref1[i2 + t] + pref12[i1 + t] - pref12[i1] + pref12[i2 + t] - pref12[i2];
        if (forced_omitted > k) { continue; }
        int can_omit = k - forced_omitted;
        int wolnee = Get(pref3, 0, i1) + Get(pref3, i2 + t, n) + Get(pref1, 0, i1) + Get(pref1, i2 + t, n);
        //pref3[i1] + pref3[n] - pref3[i2 + t] + pref1[i1] + pref1[n] - pref1[i2 + t];
        
        maxi(base, min(i1 + (n - (i2 + t)), wolnee + can_omit));
      }
    }
    cout<<base<<"\n";
  }
};

int32_t main() {

  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  cerr << fixed << setprecision(10);
  cin.tie(0);
  //double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
  
  int t = 1;
  RE (i, t) {
    Sol sol;
    sol.Test();
  }
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  return 0;
}