import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni(), P = ni();
		int[] a = na(n);
		
		SegmentTreeRXQ[] sts = new SegmentTreeRXQ[18];
		for(int i = 0;i < 18;i++){
			sts[i] = new SegmentTreeRXQ(n-P+1);
		}
		for(int i = 0;i < n;i++){
			for(int j = 0;j < 18;j++){
				if(a[i]<<~j<0){
					sts[j].flip(Math.max(0, i-P+1), i+1);
				}
			}
		}
		
		for(int z = 0;z < m;z++){
			int type = ni();
			if(type == 1){
				int ind = ni()-1;
				int x = ni();
				for(int j = 0;j < 18;j++){
					if(x<<~j<0){
						sts[j].flip(Math.max(0, ind-P+1), ind+1);
					}
				}
			}else{
				int l = Math.min(n-P+1, ni()-1), r = Math.min(n-P, ni()-1);
				long ans = 0;
				for(int j = 0;j < 18;j++){
					ans += (long)sts[j].count(l, r+1)<<j;
				}
				out.println(ans);
			}
		}
	}
	
	public static class SegmentTreeRXQ {
		public int M, H, N;
		public boolean[] plus;
		public int[] ct;
		
		public SegmentTreeRXQ(int n)
		{
			N = n;
			H = Integer.highestOneBit(Math.max(n,1))<<1;
			M = H<<1;
			plus = new boolean[H];
			ct = new int[M];
		}
		
		public SegmentTreeRXQ(int[] a)
		{
			N = a.length;
			H = Integer.highestOneBit(Math.max(N,1))<<1;
			M = H<<1;
			plus = new boolean[H];
			ct = new int[M];
			System.arraycopy(a, 0, ct, H, N);
			for(int i = H-1;i >= 1;i--)propagate(i);
		}
		
		private void propagate(int i)
		{
			if(plus[i]){
				int q = H / Integer.highestOneBit(i);
				ct[i] = q - (ct[2*i] + ct[2*i+1]);
			}else{
				ct[i] = ct[2*i] + ct[2*i+1];
			}
		}
		
		public void flip(int l, int r){ flip(l, r, 0, H, 1); }
		
		private void flip(int l, int r, int cl, int cr, int cur)
		{
			if(cur >= H){
				ct[cur] ^= 1;
			}else if(l <= cl && cr <= r){
				plus[cur] ^= true;
				propagate(cur);
			}else{
				int mid = cl+cr>>>1;
				if(cl < r && l < mid){
					flip(l, r, cl, mid, 2*cur);
				}
				if(mid < r && l < cr){
					flip(l, r, mid, cr, 2*cur+1);
				}
				propagate(cur);
			}
		}
		
		public int count(int l, int r) { return l >= r ? 0 : count(l, r, 0, H, 1); }
		
		private int count(int l, int r, int cl, int cr, int cur)
		{
			if(l <= cl && cr <= r){
				return ct[cur];
			}else{
				int mid = cl+cr>>>1;
				int ret = 0;
				if(cl < r && l < mid){
					ret += count(l, r, cl, mid, 2*cur);
				}
				if(mid < r && l < cr){
					ret += count(l, r, mid, cr, 2*cur+1);
				}
				return plus[cur] ? Math.min(r, cr) - Math.max(l, cl) - ret : ret;
			}
		}
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new C().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}