#pragma GCC optimize("O3") #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; #define int long long #define double long double #define pii pair<int, int> #define pb push_back #define F first #define S second #define ins insert #define rep(i, a, b) for(int i = a; i <= b; i++) #define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define debug(x) cout << #x << " = " << x << '\n'; #define vdebug(a) cout << #a << " = "; for(auto x : a) cout << x << " "; cout << '\n'; typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set; typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_pair_set; const double eps = 1e-9; const int mod = 1e9 + 7; const int N = 2e5 + 5; const int INF = 1e18; void solve(){ int n, Q; cin >> n >> Q; vector<int> v(n + 1); rep(i, 1, n) cin >> v[i]; while(Q --> 0){ int type; cin >> type; if(type == 1){ int i, x; cin >> i >> x; v[i] = x; } if(type == 2){ int l, r; cin >> l >> r; if((r - l + 1) % 2 == 0) cout << 0 << '\n'; else{ int res = 0; for(int i = l; i <= r; i += 2) res ^= v[i]; cout << res << '\n'; } } } } signed main(){ fastio; solve(); } /* freopen("x.in", "r", stdin); freopen("x.out", "w", stdout); */ //atilla