The grasshopper is located on the numeric axis at the point with coordinate x_0.

Having nothing else to do he starts jumping between integer points on the axis. Making a jump from a point with coordinate x with a distance d to the left moves the grasshopper to a point with a coordinate x - d, while jumping to the right moves him to a point with a coordinate x + d.

The grasshopper is very fond of positive integers, so for each integer i starting with 1 the following holds: exactly i minutes after the start he makes a jump with a distance of exactly i. So, in the first minutes he jumps by 1, then by 2, and so on.

The direction of a jump is determined as follows: if the point where the grasshopper was before the jump has an even coordinate, the grasshopper jumps to the left, otherwise he jumps to the right.

For example, if after 18 consecutive jumps he arrives at the point with a coordinate 7, he will jump by a distance of 19 to the right, since 7 is an odd number, and will end up at a point 7 + 19 = 26. Since 26 is an even number, the next jump the grasshopper will make to the left by a distance of 20, and it will move him to the point 26 - 20 = 6.

Find exactly which point the grasshopper will be at after exactly n jumps.

Input

The first line of input contains an integer t (1 ≤ t ≤ 10^4) — the number of test cases.

Each of the following t lines contains two integers x_0 (-10^{14} ≤ x_0 ≤ 10^{14}) and n (0 ≤ n ≤ 10^{14}) — the coordinate of the grasshopper's initial position and the number of jumps.

Output

Print exactly t lines. On the i-th line print one integer — the answer to the i-th test case — the coordinate of the point the grasshopper will be at after making n jumps from the point x_0.

Example

Input


9
0 1
0 2
10 10
10 99
177 13
10000000000 987654321
-433494437 87178291199
1 0
-1 1


Output


-1
1
11
110
190
9012345679
-87611785637
1
0

Note

The first two test cases in the example correspond to the first two jumps from the point x_0 = 0. 

Since 0 is an even number, the first jump of length 1 is made to the left, and the grasshopper ends up at the point 0 - 1 = -1.

Then, since -1 is an odd number, a jump of length 2 is made to the right, bringing the grasshopper to the point with coordinate -1 + 2 = 1.
9
1 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1

2
2
2
2
2
2
2
2
2

import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.util.AbstractMap;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.*;
import java.io.*;

// Java Template Pramod Hosahalli...
public class Solution {

	static FastReader in = new FastReader();
	//static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
	static int mod = 1000000007;

	private static void go() throws Exception {
		long x = in.nl();
		long n = in.nl();

		long ans = n % 4;
		if(x % 2 == 0){
			if(ans == 0){
				print(1, x + "");
				return;
			}
			if(ans == 1){
				print(1, (x - n) + "");
				return;
			}
			if(ans == 2){
				print(1, (x + 1) + "");
				return;
			}

			if(ans == 3){
				print(1, (x + 1 + n) + "");
				return;
			}
		}

			if(ans == 0){
				print(1, x + "");
				return;
			}
			if(ans == 1){
				print(1, (x + n) + "");
				return;
			}
			if(ans == 2){
				print(1, (x - 1) + "");
				return;
			}

			if(ans == 3){
				print(1, (x - 1 - n) + "");
				return;
			}
	}

	public static void main(String[] args) throws Exception {
		int t = in.ni();
		while(t-- > 0){
			go();
		}
		in.close();
	}

	private static double solve(long n, double[][] f)
	{
		double[][] res = new double[2][2];
		res[0][0] = 1;
		res[0][1] = 0;
		res[1][0] = 0;
		res[1][1] = 1;
		
		while(n > 0){
			if(n % 2 == 1) res = matrixmul(res,f);
			n = n >> 1;
			f = matrixmul(f, f);
		}
		return res[0][0];
	}

	private static long[][] matrixmul(long[][] a, long[][] b)
	{
		long[][] c = new long[2][2];
		for(int i = 0; i < 2; i++)
			for(int j = 0 ; j < 2; j++)
				for(int k = 0; k < 2; k++)
					c[i][k] = (c[i][k] + mul(a[i][j], b[j][k])) % mod; 
		return c;
	}

	private static double[][] matrixmul(double[][] a, double[][] b)
	{
		double[][] c = new double[2][2];
		for(int i = 0; i < 2; i++)
			for(int j = 0 ; j < 2; j++)
				for(int k = 0; k < 2; k++)
					c[i][k] = c[i][k] + a[i][j] *  b[j][k]; 
		return c;
	}

	static long mul(long a, long b) {
		return ((a % mod) * (b % mod)) % mod;
	}

	static class FastReader {
		final private int BUFFER_SIZE = 1 << 16;
		private DataInputStream din;
		private byte[] buffer;
		private int bufferPointer, bytesRead;

		public FastReader() {
			din = new DataInputStream(System.in);
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public FastReader(String file_name) throws IOException {
			din = new DataInputStream(new FileInputStream(file_name));
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public int[] readIntArray(int n) throws IOException{
			int[] fx = new int[n];
			for(int i = 0; i < n; i++) fx[i] = ni();
			return fx;
		}

		public long[] readLongArray(int n) throws IOException {
			long[] fx = new long[n];
			for(int i = 0; i < n; i++) fx[i] = nl();
			return fx;
		}

		public String readLine() throws IOException {
			byte[] buf = new byte[64]; // line length
			int cnt = 0, c;
			while ((c = read()) != -1) {
				if (c == '\n') {
					if (cnt != 0) {
						break;
					} else {
						continue;
					}
				}
				buf[cnt++] = (byte) c;
			}
			return new String(buf, 0, cnt);
		}

		public int ni() throws IOException {
			int ret = 0;
			byte c = read();
			while (c <= ' ') {
				c = read();
			}
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (neg)
				return -ret;
			return ret;
		}

		public long nl() throws IOException {
			long ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public double nd() throws IOException {
			double ret = 0, div = 1;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();

			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (c == '.') {
				while ((c = read()) >= '0' && c <= '9') {
					ret += (c - '0') / (div *= 10);
				}
			}

			if (neg)
				return -ret;
			return ret;
		}

		private void fillBuffer() throws IOException {
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
			if (bytesRead == -1)
				buffer[0] = -1;
		}

		private byte read() throws IOException {
			if (bufferPointer == bytesRead)
				fillBuffer();
			return buffer[bufferPointer++];
		}

		public void close() throws IOException {
			if (din == null)
				return;
			din.close();
		}
	}

	static String rl() throws Exception{
		return in.readLine();
	}

	static int pi(String s) {
		return Integer.parseInt(s);
	}

	static long pl(String s) {
		return Long.parseLong(s);
	}

	static void print(int newline, String s) {
		System.out.print(s);
		if (newline != 0) System.out.println();
		// System.out.flush();
	}

	static void print(int newline, int[] arr) {
		StringBuilder sb = new StringBuilder("");
		for(int x : arr) sb.append(x+" ");
		System.out.print(sb.toString().trim());
		if (newline != 0) System.out.println();
		// System.out.flush();
	}

	static void cprint(int x) {
		print(0, "Case #" + x + ": ");
	}

	//utility function for gcd
	private static long gcd(long a, long b)
	{
		if(a == 0 || b == 0)return a + b;
		if(a > b)return gcd(a % b, b);
		return gcd(a, b % a);
	}

	// construct sparse table : for static range queries
	static class SparseTable{
		static long[][] precompute(long[] arr)
		{
			int n = arr.length;
			int p = (int)((double)Math.log(n) / Math.log(2));
			long[][] f = new long[p+1][n];

			for(int i = 0; i < n; i++) f[0][i] = arr[i];
			for(int j = 1; j <= p; j++){
				for(int i = 0; i + (1 << j) - 1 < n; i++){
					f[j][i] = gcd(f[j-1][i], f[j-1][i + (1 << (j-1))]);
				}
			}
			return f;
		}
	}

	//Union Rank Algorithm
	static class UnionFind {
		int[] parent = null;
		int[] rank = null;

		UnionFind(int n){
			parent = new int[n];
			rank = new int[n];
			for(int i = 0; i < n; i++) parent[i] = i;
		}

		int find(int v){
			if(parent[v] != v) parent[v] = find(parent[v]);
			return parent[v];
		}

		boolean union(int x, int y) {
			int u = find(x);
			int v = find(y);

			//both belong to same set...
			if(u == v)return false;

			if(rank[u] > rank[v])
				parent[v] = u;
			else if(rank[u] < rank[v])
				parent[u] = v;
			else{
				parent[u] = v;
				rank[v]++;
			}
			return true;
		}
	}

	//Fenwick Tree Implementation
	static class BIT{
		int bit[] = null;

		BIT(int n){
			bit = new int[n+1];
		}

		private void update(int x){
			int index = x;
			while(index < bit.length){
				bit[index]+=1;
				index += (index & -index);
			}
		}

		private int sum(int l){
			int index = l-1;
			int c = 0;
			while(index > 0){
				c+=bit[index];
				index -= (index & -index);
			}
			return c;
		}
	}

	//Suffix Array Impl
	static class SuffixArray{

		// suffix array in O(n*log^2(n))
		public static Integer[] suffixArray(CharSequence s) {
			int n = s.length();
			Integer[] sa = new Integer[n];
			int[] rank = new int[n];
			for (int i = 0; i < n; i++) {
				sa[i] = i;
				rank[i] = s.charAt(i);
			}
			for (int len = 1; len < n; len *= 2) {
				long[] rank2 = new long[n];
				for (int i = 0; i < n; i++)
					rank2[i] = ((long) rank[i] << 32) + (i + len < n ? rank[i + len] + 1 : 0);

				Arrays.sort(sa, (a, b) -> Long.compare(rank2[a], rank2[b]));

				for (int i = 0; i < n; i++)
					rank[sa[i]] = i > 0 && rank2[sa[i - 1]] == rank2[sa[i]] ? rank[sa[i - 1]] : i;
			}
			return sa;
		}
	}

}