#include<bits/stdc++.h>
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout << it << " "; cout << endl;
using namespace std;
using ll = long long;
using ld = long double;

const int N = 2e5 + 9;
vector<vector<int>> t(4 * N, vector<int> (32));

struct Segment_Tree {
    auto merge(auto &l, auto &r) { // <== Change this function
        vector<int> tmp(32);
        for(int b = 0; b < 32; b++) tmp[b] = l[b] + r[b];
        return tmp;
    }
    void build(int node, int st, int en, vector<ll> &arr) { //=> O(N)
        if (st == en) {
            // t[node] = arr[st];
            bitset<32> b1 = arr[st];
            for(int b = 0; b < 32; b++) t[node][b] = b1[b];
            return;
        }
        int mid = (st + en) >> 1;
        build(node << 1, st, mid, arr); // divide left side
        build(node << 1 | 1, mid + 1, en, arr); // divide right side
        // Merging left and right portion
        auto &Cur = t[node];
        auto &Left = t[node << 1];
        auto &Right = t[node << 1 | 1];
        Cur = merge(Left, Right);
        return;
    }
    void update(int node, int st, int en, int idx, ll val) { //=> O(log n)
        if (st == en) {
            bitset<32> b1 = val;
            for(int b = 0; b < 32; b++) {
                if(t[node][b] == 1 && b1[b] == 0) t[node][b] = 1;
                else if(t[node][b] == 0 && b1[b] == 1) t[node][b] = 1;
                else if(t[node][b] == 1 && b1[b] == 1) t[node][b] = 0;
            }
            // t[node] = val;
            return;
        }
        int mid = (st + en) >> 1;
        if (idx <= mid) update(node << 1, st, mid, idx, val);
        else update(node << 1 | 1, mid + 1, en, idx, val);
        // Merging left and right portion
        auto &Cur = t[node];
        auto &Left = t[node << 1];
        auto &Right = t[node << 1 | 1];
        Cur = merge(Left, Right);
        return;
    }
    auto query(int node, int st, int en, int l, int r) { //=> O(log n)
        if (st > r || en < l) { // No overlapping and out of range
            return vector<int> (32, 0); // <== careful 
        }
        if (l <= st && en <= r) { // Complete overlapped (l-r in range)
            return t[node];
        }
        // Partial overlapping
        int mid = (st + en) >> 1;
        auto Left = query(node << 1, st, mid, l, r);
        auto Right = query(node << 1 | 1, mid + 1, en, l, r);
        return merge(Left, Right);
    }
} st1;

ll mod = 1e9 + 7;

ll Pow(ll a, ll b) { // O(log b)
    a %= mod;
    ll ans = 1;
    while (b) {
        if (b & 1) ans = (ans * a) % mod;
        a = (a * a) % mod;
        b >>= 1;
    }
    return ans;
}

void solve() {
    ll n, q;
    cin >> n >> q;
    vector<ll> v(n + 1);
    for (int i = 1; i <= n; i++) {
        ll x; cin >> x;
        v[i] = x;
    }
    st1.build(1, 1, n, v);
    short type;
    while(q--) {
        cin >> type;
        if(type == 1) {
            int pos, x;
            cin >> pos >> x;
            st1.update(1, 1, n, pos, x);
        }
        else {
            int l, r;
            cin >> l >> r;
            auto bitCnt = st1.query(1, 1, n, l, r);
            // coutall(bitCnt);
            ll sum = 0, sz = r - l + 1;
            for(int b = 0; b < 32; b++) {
                ll cnt0 = sz - bitCnt[b];
                ll cnt1 = bitCnt[b];
                if(cnt1 > 0) {
                    ll totCom = (Pow(2, cnt1 - 1) * Pow(2, cnt0)) % mod; // (nC1 + nC3 + ...+ nClastOdd = 2^(n - 1)) * (nC0 + nC1 + ...+nCn = 2^n)
                    sum += (totCom * Pow(2, b)) % mod;
                    sum %= mod;
                }
            }
            cout << sum << endl;
        }
    }
    return;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}