#include <bits/stdc++.h>
#define int long long
using namespace std;
inline void read(int &x) {
    bool flag = 1;
    char c = getchar();
    while (!isalnum(c)) {
        if (c == '-')
            flag = 0;
        c = getchar();
    }
    x = c - '0';
    c = getchar();
    while (isalnum(c)) {
        x = (x << 3) + (x << 1) + c - '0';
        c = getchar();
    }
    if (!flag) x = ~(x - 1);
}
inline void write(int x) {
    if (x < 0) {
        putchar('-');
        x = ~(x - 1);
    }
    if (x > 9)
    write(x / 10);
    putchar(x % 10 + '0');
}
const int N = 2e5 + 5;
int n, q, sum[N << 2], a[N], add[N << 2];
void pushdown(int k, int len) {
    if (!add[k])
        return ;
    add[k << 1] ^= 1;
    add[k << 1 | 1] ^= 1;
    sum[k << 1] = len - (len >> 1) - sum[k << 1];
    sum[k << 1 | 1] = (len >> 1) - sum[k << 1 | 1];
    add[k] = 0;
}
void build(int k, int l, int r) {
    if (l == r) {
        sum[k] = a[l];
        return ;
    }
    int mid = (l + r) >> 1;
    build(k << 1, l, mid);
    build(k << 1 | 1, mid + 1, r);
    sum[k] = sum[k << 1] + sum[k << 1 | 1];
    return ;
}
void change(int k, int l, int r, int x, int y) {
    pushdown(k, r - l + 1);
    if (l >= x && r <= y) {
        add[k] ^= 1;
        sum[k] = (r - l + 1) - sum[k];
        return ;
    }
    int mid = (l + r) >> 1;
    if (mid >= x) change(k << 1, l, mid, x, y);
    if (mid < y) change(k << 1 | 1, mid + 1, r, x, y);
    sum[k] = sum[k << 1] + sum[k << 1 | 1];
    return ;
}
int query(int k, int l, int r, int x, int y) {
    if (l >= x && r <= y)
        return sum[k];
    pushdown(k, r - l + 1);
    int mid = (l + r) >> 1, ans = 0;
    if (mid >= x) ans += query(k << 1, l, mid, x, y);
    if (mid < y) ans += query(k << 1 | 1, mid + 1, r, x, y);
    return ans;
}
signed main() {
    //freopen("P2574_2.in", "r", stdin);
    //freopen("P2574.out", "w", stdout);
    read(n), read(q);
    for (int i = 1; i <= n; i++) {
        char c = getchar();
        while (c != '0' && c != '1')
            c = getchar();
        a[i] = c - '0';
    }
    build(1, 1, n);
    while (q--) {
        int opt, l, r;
        read(opt), read(l), read(r);
        switch(opt) {
        case 0:
            change(1, 1, n, l, r);
            break;
        case 1:
            write(query(1, 1, n, l, r));
            putchar('\n');
            break;
        }
    }
    return 0;
}

莫名RE了2个点