#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

// 「i ビット目が立っていることと j ビット目が立っていることは同値か」という情報を持たせる
// 450 ビットぶんにしないと TLE する？　→　それでも間に合わないのマジ？？？

struct S{
    ll val;
    bitset<450> bs;
};

S op(S a, S b){
    return S{a.val | b.val, a.bs & b.bs};
}

S e(){
    bitset<450> bs_1;
    bs_1.set();
    return S{0, bs_1};
}

int main() {
    ll N, Q;
    cin >> N >> Q;
    vector<ll> A(N);
    rep(i, N){
        cin >> A[i];
    }

    segtree<S, op, e> seg(N);
    rep(i, N){
        bitset<450> bs;
        bs.set();
        ll now_cnt = 0;
        for (ll j = 0; j < 30; j++){
            for (ll k = j + 1; k < 30; k++){
                ll on_j = ((A[i] >> j) & 1);
                ll on_k = ((A[i] >> k) & 1);
                if (on_j != on_k){
                    bs.set(now_cnt, 0);
                }
                now_cnt++;
            }
        }
        seg.set(i, S{A[i], bs});
    }

    vector<mint> pow_2(N + 1);
    pow_2[0] = mint(1);
    for (ll i = 0; i < N; i++){
        pow_2[i + 1] = pow_2[i] * mint(2);
    }

    for (ll i = 0; i < Q; i++){
        ll type;
        cin >> type;
        if (type == 1){
            ll p, x;
            cin >> p >> x;
            p--;
            ll now_cnt = 0;
            bitset<450> bs;
            bs.set();
            for (ll j = 0; j < 30; j++){
                for (ll k = j + 1; k < 30; k++){
                    ll on_j = ((x >> j) & 1);
                    ll on_k = ((x >> k) & 1);
                    if (on_j != on_k){
                        bs.set(now_cnt, 0);
                    }
                    now_cnt++;
                }
            }
            seg.set(p, S{x, bs});
        }
        else{
            ll L, R;
            cin >> L >> R;
            L--;
            R--;

            ll len = R - L + 1;
            mint ans = mint(0);
            S pr = seg.prod(L, R + 1);
            ll val = pr.val;
            bitset<450> bs = pr.bs;
            for (ll j = 0; j < 30; j++){
                if ((val >> j) & 1){
                    // ans += pow_m2[j] * pow_m2[j] * pow_len;
                }
            }
            ll now_cnt = 0;
            for (ll j = 0; j < 30; j++){
                for (ll k = j + 1; k < 30; k++){
                    if ((val >> j) & 1){
                        if ((val >> k) & 1){
                            if (bs[now_cnt]){
                                // ans += pow_m2[1] * pow_m2[j] * pow_m2[k] * pow_len;
                            }
                            else{
                                // ans += pow_m2[1] * pow_m2[j] * pow_m2[k] * pow_len_2;
                            }
                        }
                    }
                    now_cnt++;
                }
            }
            cout << ans.val() << endl;
        }
    }
}