#include <bits/stdc++.h>

#include <atcoder/all>

using namespace std;
using namespace atcoder;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
// #define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

struct S {
    ll zero, one;
    ll zero_match, one_match, jun_match, gyaku_match;
    S(ll zero=0, ll one=0): zero(zero), one(one){
        zero_match = one_match = jun_match = gyaku_match = 0;
    }
};

S e() {return S();}
S f(S a, S b) {
    S res;
    res.zero = a.zero + b.zero;
    res.one = a.one + b.one;
    res.zero_match = a.zero_match + b.zero_match + a.zero * b.zero;
    res.one_match = a.one_match + b.one_match + a.one * b.one;
    res.jun_match = a.jun_match + b.jun_match + a.zero * b.one;
    res.gyaku_match = a.gyaku_match + b.gyaku_match + a.one * b.zero;
    return res;
}
S g(bool b, S a) {
    if (b) {
        swap(a.zero, a.one);
        swap(a.zero_match, a.one_match);
        swap(a.jun_match, a.gyaku_match);
    }
    return a;
}
bool h(bool a, bool b) {return a ^ b;}
bool id() {return false;}

signed main() {
    fio();
    int n, q;
    cin >> n >> q;
    vector<S> a(n);
    rep (i, n) {
        int x;
        cin >> x;
        if (x == 0) a[i].zero++;
        else a[i].one++;
    }

    lazy_segtree<S, f, e, bool, g, h, id> seg(a);

    while (q--) {
        int t, l, r;
        cin >> t >> l >> r;
        l--;
        if (t == 1) {
            seg.apply(l, r, true);
        }
        else {
            S res = seg.prod(l, r);
            cout << res.gyaku_match << endl;
        }
    }
}

Measured memory_bytes: 37292