#include <bits/stdc++.h> using namespace std; vector<string> split_string(string); // Complete the xorQueries function below. vector<long> xorQueries(vector<int> a, int m, int p) { vector<long> ans; int n = a.size(); while(m--){ int q,l,r; cin>>q>>l>>r; if(q == 1){ a[l-1] ^= r; } else{ long i,sum=0,j; l--; for(i=l;i<r;i++){ long tot = 0; if(i+p-1 < n) for(j=i;j<n && j<i+p;j++){ tot ^= a[j]; } sum += tot; } ans.push_back(sum); } } return ans; } int main() { ofstream fout(getenv("OUTPUT_PATH")); string nmp_temp; getline(cin, nmp_temp); vector<string> nmp = split_string(nmp_temp); int n = stoi(nmp[0]); int m = stoi(nmp[1]); int p = stoi(nmp[2]); string a_temp_temp; getline(cin, a_temp_temp); vector<string> a_temp = split_string(a_temp_temp); vector<int> a(n); for (int i = 0; i < n; i++) { int a_item = stoi(a_temp[i]); a[i] = a_item; } vector<long> result = xorQueries(a, m, p); for (int i = 0; i < result.size(); i++) { fout << result[i]; if (i != result.size() - 1) { fout << "\n"; } } fout << "\n"; fout.close(); return 0; } vector<string> split_string(string input_string) { string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) { return x == y and x == ' '; }); input_string.erase(new_end, input_string.end()); while (input_string[input_string.length() - 1] == ' ') { input_string.pop_back(); } vector<string> splits; char delimiter = ' '; size_t i = 0; size_t pos = input_string.find(delimiter); while (pos != string::npos) { splits.push_back(input_string.substr(i, pos - i)); i = pos + 1; pos = input_string.find(delimiter, i); } splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1)); return splits; }