Problem: Inna is fed up with jokes about female logic. So she started using binary logic instead.

Inna has an array of n elements a1[1], a1[2], ..., a1[n]. Girl likes to train in her binary logic, so she does an exercise consisting of n stages: on the first stage Inna writes out all numbers from array a1, on the i-th (i ≥ 2) stage girl writes all elements of array ai, which consists of n - i + 1 integers; the k-th integer of array ai is defined as follows: ai[k] = ai - 1[k] AND ai - 1[k + 1]. Here AND is bit-wise binary logical operation.

Dima decided to check Inna's skill. He asks Inna to change array, perform the exercise and say the sum of all <image> elements she wrote out during the current exercise.

Help Inna to answer the questions!

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 105) — size of array a1 and number of Dima's questions. Next line contains n integers a1[1], a1[2], ..., a1[n] (0 ≤ ai ≤ 105) — initial array elements.

Each of next m lines contains two integers — Dima's question description. Each question consists of two integers pi, vi (1 ≤ pi ≤ n; 0 ≤ vi ≤ 105). For this question Inna should make a1[pi] equals vi, and then perform the exercise. Please, note that changes are saved from question to question.

Output

For each question print Inna's answer on a single line.

Examples

Input

3 4
1 1 1
1 1
2 2
3 2
1 2


Output

6
4
7
12

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Calendar;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.SortedSet;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

/**
 * #
 * 
 * @author pttrung
 */
public class E_Round_234_Div2 {

	public static long MOD = 1000000007;

	public static void main(String[] args) throws FileNotFoundException {
		// PrintWriter out = new PrintWriter(new FileOutputStream(new File(
		// "output.txt")));
		PrintWriter out = new PrintWriter(System.out);
		Scanner in = new Scanner();
		int n = in.nextInt();
		int m = in.nextInt();
		int[] data = new int[n];
		for (int i = 0; i < n; i++) {
			data[i] = in.nextInt();
		}
		TreeSet<Point>[] list = new TreeSet[17];
		for (int i = 0; i < 17; i++) {
			list[i] = new TreeSet<>();
		}
		long total = 0;
		for (int j = 0; j < 17; j++) {
			int start = -1;
			for (int i = 0; i < n; i++) {
				if (((1 << j) & data[i]) == 0) {
					if (start != -1) {
						list[j].add(new Point(start, i - 1));
						long length = i - start;
						total += (1 << j) * length * (length + 1) / 2;
						start = -1;
					}
				} else {
					if (start == -1) {
						start = i;
					}
				}
			}
			if (start != -1) {
				list[j].add(new Point(start, n - 1));
				long length = n - start;
				total += (1 << j) * length * (length + 1) / 2;
			}

		}
		for (int i = 0; i < m; i++) {
			int p = in.nextInt() - 1;
			int v = in.nextInt();
			for (int j = 0; j < 17; j++) {
				Point tmp = list[j].floor(new Point(p, p));
				if (tmp != null) {
					if (((1 << j) & v) == 0) {
						if (tmp.x <= p && tmp.y >= p) {
							long length = tmp.y - tmp.x + 1;

							total -= (1 << j) * length * (length + 1) / 2;
							int y = tmp.y;
							if (tmp.x < p) {
								tmp.y = p - 1;
								long x = p - tmp.x;
								total += (1 << j) * x * (x + 1) / 2;
							} else {
								list[j].remove(tmp);
							}
							
							if (p + 1 <= y) {
								list[j].add(new Point(p + 1, y));
								long x = y - p;
								total += (1 << j) * x * (x + 1) / 2;
							}
						}
					} else {
						if (tmp.x <= p && tmp.y >= p) {
							// Do nothing
						} else {
							Point other = list[j].ceiling(new Point(p, p));
							if (tmp.y + 1 == p) {
								if (other != null && other.x == p + 1) {
									long x = tmp.y - tmp.x + 1;
									total -= (1 << j) * x * (x + 1) / 2;
									x = other.y - other.x + 1;
									total -= (1 << j) * x * (x + 1) / 2;

									list[j].remove(other);
									x = other.y - tmp.x + 1;
									total += (1 << j) * x * (x + 1) / 2;
									tmp.y = other.y;
								} else {
									int x = tmp.y - tmp.x + 1;
									total -= (1 << j) * x * (x + 1) / 2;
									total += (1 << j) * (x + 1) * (x + 2) / 2;
									tmp.y++;
								}
							} else {
								if (other != null && other.x == p + 1) {
									long x = other.y - other.x + 1;
									total -= (1 << j) * x * (x + 1) / 2;

									list[j].remove(other);
									other.x = p;
									x = other.y - other.x + 1;
									total += (1 << j) * x * (x + 1) / 2;
									list[j].add(other);

								} else {
									total += (1 << j);
									list[j].add(new Point(p, p));
								}
							}
						}
					}
				} else {
					Point other = list[j].ceiling(new Point(p, p));
					if (other != null) {
						if (((1 << j) & v) != 0) {
							if (other != null && other.x == p + 1) {
								long x = other.y - other.x + 1;
								total -= (1 << j) * x * (x + 1) / 2;

								list[j].remove(other);
								other.x = p;
								x = other.y - other.x + 1;
								total += (1 << j) * x * (x + 1) / 2;
								list[j].add(other);

							} else {
								total += (1 << j);
								list[j].add(new Point(p, p));
							}
						} 
					} else {
						if (((1 << j) & v) != 0) {
							list[j].add(new Point(p, p));
							total += (1 << j);
						}
					}
				}
				//System.out.println(i + " " + j + " " + list[j]);
			}
			out.println(total);
		}
		out.close();
	}

	public static int[] KMP(String val) {
		int i = 0;
		int j = -1;
		int[] result = new int[val.length() + 1];
		result[0] = -1;
		while (i < val.length()) {
			while (j >= 0 && val.charAt(j) != val.charAt(i)) {
				j = result[j];
			}
			j++;
			i++;
			result[i] = j;
		}
		return result;

	}

	public static boolean nextPer(int[] data) {
		int i = data.length - 1;
		while (i > 0 && data[i] < data[i - 1]) {
			i--;
		}
		if (i == 0) {
			return false;
		}
		int j = data.length - 1;
		while (data[j] < data[i - 1]) {
			j--;
		}
		int temp = data[i - 1];
		data[i - 1] = data[j];
		data[j] = temp;
		Arrays.sort(data, i, data.length);
		return true;
	}

	public static int digit(long n) {
		int result = 0;
		while (n > 0) {
			n /= 10;
			result++;
		}
		return result;
	}

	public static double dist(long a, long b, long x, long y) {
		double val = (b - a) * (b - a) + (x - y) * (x - y);
		val = Math.sqrt(val);
		double other = x * x + a * a;
		other = Math.sqrt(other);
		return val + other;

	}

	public static class Point implements Comparable<Point> {

		int x, y;

		public Point(int start, int end) {
			this.x = start;
			this.y = end;
		}

		@Override
		public int hashCode() {
			int hash = 5;
			hash = 47 * hash + this.x;
			hash = 47 * hash + this.y;
			return hash;
		}

		@Override
		public String toString() {
			return "Point [x=" + x + ", y=" + y + "]";
		}

		@Override
		public boolean equals(Object obj) {
			if (obj == null) {
				return false;
			}
			if (getClass() != obj.getClass()) {
				return false;
			}
			final Point other = (Point) obj;
			if (this.x != other.x) {
				return false;
			}
			if (this.y != other.y) {
				return false;
			}
			return true;
		}

		@Override
		public int compareTo(Point o) {
			return Integer.compare(x, o.x);
		}
	}

	public static class FT {

		long[] data;

		FT(int n) {
			data = new long[n];
		}

		public void update(int index, long value) {
			while (index < data.length) {
				data[index] += value;
				index += (index & (-index));
			}
		}

		public long get(int index) {
			long result = 0;
			while (index > 0) {
				result += data[index];
				index -= (index & (-index));
			}
			return result;

		}
	}

	public static long gcd(long a, long b) {
		if (b == 0) {
			return a;
		}
		return gcd(b, a % b);
	}

	public static long pow(long a, long b) {
		if (b == 0) {
			return 1;
		}
		if (b == 1) {
			return a;
		}
		long val = pow(a, b / 2);
		if (b % 2 == 0) {
			return val * val % MOD;
		} else {
			return val * (val * a % MOD) % MOD;

		}
	}

	static class Scanner {

		BufferedReader br;
		StringTokenizer st;

		public Scanner() throws FileNotFoundException {
			// System.setOut(new PrintStream(new
			// BufferedOutputStream(System.out), true));
			br = new BufferedReader(new InputStreamReader(System.in));
			// br = new BufferedReader(new InputStreamReader(new
			// FileInputStream(new File("input.txt"))));
		}

		public String next() {

			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (Exception e) {
					throw new RuntimeException();
				}
			}
			return st.nextToken();
		}

		public long nextLong() {
			return Long.parseLong(next());
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public String nextLine() {
			st = null;
			try {
				return br.readLine();
			} catch (Exception e) {
				throw new RuntimeException();
			}
		}

		public boolean endLine() {
			try {
				String next = br.readLine();
				while (next != null && next.trim().isEmpty()) {
					next = br.readLine();
				}
				if (next == null) {
					return true;
				}
				st = new StringTokenizer(next);
				return st.hasMoreTokens();
			} catch (Exception e) {
				throw new RuntimeException();
			}
		}
	}
}