#include #define rep(i, a) for (int i = (int)0; i < (int)a; ++i) #define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i) #define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i) #define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define popcount __builtin_popcount using ll = long long; constexpr ll mod = 1e9 + 7; constexpr ll INF = 1LL << 60; template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } ll gcd(ll n, ll m) { ll tmp; while (m != 0) { tmp = n % m; n = m; m = tmp; } return n; } ll lcm(ll n, ll m) { return abs(n) / gcd(n, m) * abs(m); //gl=xy } using namespace std; void solve() { int n,k; cin>>n>>k; string s; cin>>s; int cnt=0,atari=0; int pos=0; int ccnt=0; int ans=0; while(pos0){ --atari; } else ++cnt; if(s[pos]=='1'){ ++atari; } else if(s[pos]=='2'){ atari+=2; } ++pos; } ccnt=cnt; int pre_atari=atari; if(atari>0){ pos=0; while(pos0){ --atari; } else ++cnt; if(s[pos]=='1'){ ++atari; } else if(s[pos]=='2'){ atari+=2; } ++pos; } if(pre_atari!=atari){ int ppos=2*n; while(ppos0){ --atari; } else ++cnt; if(s[pos]=='1'){ ++atari; } else if(s[pos]=='2'){ atari+=2; } ++pos; ++ppos; } } if(ppos==k){ cout<0){ --atari; } else ++cnt; if(s[pos]=='1'){ ++atari; } else if(s[pos]=='2'){ atari+=2; } ++pos; } ans+=cnt; cout<