#line 1 "A.cpp" // #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; template <class T> using pq = priority_queue<T>; template <class T> using qp = priority_queue<T, vector<T>, greater<T>>; #define vec(T, A, ...) vector<T> A(__VA_ARGS__); #define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__)); #define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__))); #ifndef RIN__LOCAL #define endl "\n" #endif #define spa ' ' #define len(A) A.size() #define all(A) begin(A), end(A) #define fori1(a) for(ll _ = 0; _ < (a); _++) #define fori2(i, a) for(ll i = 0; i < (a); i++) #define fori3(i, a, b) for(ll i = (a); i < (b); i++) #define fori4(i, a, b, c) for(ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c)) #define overload4(a, b, c, d, e, ...) e #define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__) template <typename T> vector<tuple<ll, T>> ENUMERATE(vector<T> &A, ll s = 0){ vector<tuple<ll, T>> ret(A.size()); for(int i = 0; i < A.size(); i++) ret[i] = {i + s, A[i]}; return ret; } vector<tuple<ll, char>> ENUMERATE(string &A, ll s = 0){ vector<tuple<ll, char>> ret(A.size()); for(int i = 0; i < A.size(); i++) ret[i] = {i + s, A[i]}; return ret; } #define enum1(A) fori(A.size()) #define enum2(a, A) for(auto a:A) #define enum3(i, a, A) for(auto&& [i, a]: ENUMERATE(A)) #define enum4(i, a, A, s) for(auto&& [i, a]: ENUMERATE(A, s)) #define enum(...) overload4(__VA_ARGS__, enum4, enum3, enum2, enum1)(__VA_ARGS__) template <typename T, typename S> vector<tuple<T, S>> ZIP(vector<T> &A, vector<S> &B){ int n = min(A.size(), B.size()); vector<tuple<T, S>> ret(n); for(int i = 0; i < n; i++) ret[i] = {A[i], B[i]}; return ret; } template <typename T, typename S> vector<tuple<ll, T, S>> ENUMZIP(vector<T> &A, vector<S> &B, ll s = 0){ int n = min(A.size(), B.size()); vector<tuple<ll, T, S>> ret(n); for(int i = 0; i < n; i++) ret[i] = {i + s, A[i], B[i]}; return ret; } #define zip4(a, b, A, B) for(auto&& [a, b]: ZIP(A, B)) #define enumzip5(i, a, b, A, B) for(auto&& [i, a, b]: ENUMZIP(A, B)) #define enumzip6(i, a, b, A, B, s) for(auto&& [i, a, b]: ENUMZIP(A, B, s)) #define overload6(a, b, c, d, e, f, g, ...) g #define zip(...) overload6(__VA_ARGS__, enumzip6, enumzip5, zip4, _, _, _)(__VA_ARGS__) vector<char> stoc(string &S){ int n = S.size(); vector<char> ret(n); for(int i = 0; i < n; i++) ret[i] = S[i]; return ret; } #define INT(...) int __VA_ARGS__; inp(__VA_ARGS__); #define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__); #define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__); #define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__); #define VEC(T, A, n) vector<T> A(n); inp(A); #define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A); const ll MOD1 = 1000000007; const ll MOD9 = 998244353; template<class T> auto min(const T& a){ return *min_element(all(a)); } template<class T> auto max(const T& a){ return *max_element(all(a)); } template <class T, class S> auto clamp(T &a, const S &l, const S &r) { return (a > r ? r : a < l ? l : a); } template <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); } template <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); } template <class T, class S> inline bool chclamp(T &a, const S &l, const S &r) { auto b = clamp(a, l, r); return (a != b ? a = b, 1 : 0); } void FLUSH(){cout << flush;} void print(){cout << endl;} template <class Head, class... Tail> void print(Head &&head, Tail &&... tail) { cout << head; if (sizeof...(Tail)) cout << spa; print(forward<Tail>(tail)...); } template<typename T> void print(vector<T> &A){ int n = A.size(); for(int i = 0; i < n; i++){ cout << A[i]; if(i != n - 1) cout << ' '; } cout << endl; } template<typename T> void print(vector<vector<T>> &A){ for(auto &row: A) print(row); } template<typename T, typename S> void print(pair<T, S> &A){ cout << A.first << spa << A.second << endl; } template<typename T, typename S> void print(vector<pair<T, S>> &A){ for(auto &row: A) print(row); } template<typename T, typename S> void prisep(vector<T> &A, S sep){ int n = A.size(); for(int i = 0; i < n; i++){ cout << A[i]; if(i == n - 1) cout << endl; else cout << sep; } } template<typename T, typename S> void priend(T A, S end){ cout << A << end; } template<typename T> void priend(T A){ priend(A, spa); } template<class... T> void inp(T&... a){ (cin >> ... >> a); } template<typename T> void inp(vector<T> &A){ for(auto &a:A) cin >> a; } template<typename T> void inp(vector<vector<T>> &A){ for(auto &row:A) inp(row); } template<typename T, typename S> void inp(pair<T, S> &A){ inp(A.first, A.second); } template<typename T, typename S> void inp(vector<pair<T, S>> &A){ for(auto &row: A) inp(row.first, row.second); } template<typename T> T sum(vector<T> &A){ T tot = 0; for(auto a:A) tot += a; return tot; } template<typename T> pair<vector<T>, map<T, int>> compression(vector<T> X){ sort(all(X)); X.erase(unique(all(X)), X.end()); map<T, int> mp; for(int i = 0; i < X.size(); i++) mp[X[i]] = i; return {X, mp}; } vector<vector<int>> read_edges(int n, int m, bool direct=false, int indexed=1){ vector<vector<int>> edges(n, vector<int>()); for(int i = 0; i < m; i++){ INT(u, v); u -= indexed; v -= indexed; edges[u].push_back(v); if(!direct) edges[v].push_back(u); } return edges; } vector<vector<int>> read_tree(int n, int indexed=1){ return read_edges(n, n - 1, false, indexed); } template<typename T> vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct=false, int indexed=1){ vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>()); for(int i = 0; i < m; i++){ INT(u, v); T w; inp(w); u -= indexed; v -= indexed; edges[u].push_back({v, w}); if(!direct) edges[v].push_back({u, w}); } return edges; } template<typename T> vector<vector<pair<int, T>>> read_wtree(int n, int indexed=1){ return read_wedges<T>(n, n - 1, false, indexed); } #line 2 "Library/C++/data_structure/segTree.hpp" template<class S, S(*op)(S, S), S(*e)()> struct segtree{ public: segtree(vector<S> &v) : _n(int(v.size())){ size = 1; log = 0; while(size < _n){ log++; size <<= 1; } d = vector<S>(2 * size, e()); for(int i = 0; i < _n; i++) d[size + i] = v[i]; for(int i = size - 1; i >= 1; i--) update(i); } segtree(int n): segtree(vector<S>(n, e())){}; void set(int p, S x){ p += size; d[p] = x; for(int i = 1; i <= log; i++) update(p >> i); } S get(int p){ return d[p + size]; } S prod(int l, int r){ S sml = e(), smr = e(); l += size; r += size; while(l < r){ if(l & 1) sml = op(sml, d[l++]); if(r & 1) smr = op(d[--r], smr); l >>= 1; r >>= 1; } return op(sml, smr); } private: int _n, size, log; vector<S> d; void update(int k){ d[k] = op(d[2 * k], d[2 * k + 1]); } }; #line 233 "A.cpp" struct S{ char l; char r; int lrow; int rrow; int len; int maxrow; int c0 = 0; int c1 = 0; }; S op(S l, S r){ if(l.len == 0) return r; if(r.len == 0) return l; S ret; ret.l = l.l; ret.r = r.r; ret.lrow = l.lrow; if(l.lrow == l.len && l.r == r.l) ret.lrow += r.lrow; ret.rrow = r.rrow; if(r.rrow == r.len && l.r == r.l) ret.rrow += l.rrow; ret.len = l.len + r.len; ret.maxrow = max(l.maxrow, r.maxrow); if(l.r == r.l) chmax(ret.maxrow, l.rrow + r.lrow); ret.c0 = l.c0 + r.c0; ret.c1 = l.c1 + r.c1; return ret; } S e(){ return {'$', '$', 0, 0, 0, 0, 0, 0}; } void solve(){ INT(n, Q); vec(S, ini, n); fori(i, n){ CHAR(s); ini[i] = {s, s, 1, 1, 1, 1, 0, 0}; if(s == '0') ini[i].c0++; else ini[i].c1++; } segtree<S, op, e> seg(ini); fori(Q){ INT(l, r, k); auto res = seg.prod(l - 1, r); if(res.maxrow >= k){ int ans = res.c0 - res.c1; ans %= 2 * k - 1; ans += 3 * k - 2; ans %= 2 * k - 1; ans -= k - 1; ans = abs(ans); ans = 2 * k - 2 - ans; print(ans); } else{ print(res.len); } } } int main(){ cin.tie(0)->sync_with_stdio(0); // cout << fixed << setprecision(12); int t; t = 1; // cin >> t; while(t--) solve(); return 0; }