description: 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.
solution: import java.util.*; import java.io.*; import java.math.*;
  public class Main{
  	//見なくていいよ　ここから------------------------------------------
  	static class InputIterator{
  		ArrayList<String> inputLine = new ArrayList<>(buf);
  		int index = 0; int max; String read;
  		InputIterator(){
  			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  			try{
  				while((read = br.readLine()) != null){
  					inputLine.addAll(Arrays.asList(read.split(" ")));
  				}
  			}catch(IOException e){}
  			max = inputLine.size();
  		}
  		boolean hasNext(){return (index < max);}
  		String next(){
  			if(hasNext()){
  				return inputLine.get(index++);
  			}else{
  				throw new IndexOutOfBoundsException("There is no more input");
  			}
  		}
  	}
  	//入力バッファサイズのつもり。入力点数（スペース区切りでの要素数）が100万を超える場合はバッファサイズを100万にすること
  	static int buf = 1024;
  	static HashMap<Integer, String> CONVSTR = new HashMap<>();
  	static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
  	static PrintWriter out = new PrintWriter(System.out);
  	static void flush(){out.flush();}
  	static void myout(Object t){out.println(t);}
  	static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
  	static String next(){return ii.next();}
  	static boolean hasNext(){return ii.hasNext();}
  	static int nextInt(){return Integer.parseInt(next());}
  	static long nextLong(){return Long.parseLong(next());}
  	static double nextDouble(){return Double.parseDouble(next());}
  	static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
  	static ArrayList<String> nextStrArray(int size){
  		ArrayList<String> ret = new ArrayList<>(size);
  		for(int i = 0; i < size; i++){
  			ret.add(next());
  		}
  		return ret;
  	}
  	static ArrayList<Integer> nextIntArray(int size){
  		ArrayList<Integer> ret = new ArrayList<>(size);
  		for(int i = 0; i < size; i++){
  			ret.add(Integer.parseInt(next()));
  		}
  		return ret;
  	}
  	static ArrayList<Long> nextLongArray(int size){
  		ArrayList<Long> ret = new ArrayList<>(size);
  		for(int i = 0; i < size; i++){
  			ret.add(Long.parseLong(next()));
  		}
  		return ret;
  	}
  	@SuppressWarnings("unchecked")
  	static String myconv(Object list, int no){//only join
  		StringBuilder sb = new StringBuilder("");
  		String joinString = CONVSTR.get(no);
  		if(list instanceof String[]){
  			return String.join(joinString, (String[])list);
  		}else if(list instanceof long[]){
  			long[] tmp = (long[])list;
  			if(tmp.length == 0){
  				return "";
  			}
  			sb.append(String.valueOf(tmp[0]));
  			for(int i = 1; i < tmp.length; i++){
  				sb.append(joinString).append(String.valueOf(tmp[i]));
  			}
  			return sb.toString();
  		}else if(list instanceof int[]){
  			int[] tmp = (int[])list;
  			if(tmp.length == 0){
  				return "";
  			}
  			sb.append(String.valueOf(tmp[0]));
  			for(int i = 1; i < tmp.length; i++){
  				sb.append(joinString).append(String.valueOf(tmp[i]));
  			}
  			return sb.toString();
  		}else if(list instanceof ArrayList){
  			ArrayList tmp = (ArrayList)list;
  			if(tmp.size() == 0){
  				return "";
  			}
  			sb.append(tmp.get(0));
  			for(int i = 1; i < tmp.size(); i++){
  				sb.append(joinString).append(tmp.get(i));
  			}
  			return sb.toString();
  		}else{
  			throw new ClassCastException("Don't join");
  		}
  	}
  	static ArrayList<String> myconv(String str, int no){//only split
  		String splitString = CONVSTR.get(no);
  		return new ArrayList<String>(Arrays.asList(str.split(splitString)));
  	}
  	static ArrayList<String> myconv(String str, String no){
  		return new ArrayList<String>(Arrays.asList(str.split(no)));
  	}
  	public static void main(String[] args){
  		CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
  		solve();flush();
  	}
  	//見なくていいよ　ここまで------------------------------------------
  	//このコードをコンパイルするときは、「-encoding UTF-8」を指定すること
  	static void solve(){//ここがメイン関数
  		int t = nextInt();
  		while(hasNext()){
  			long x = nextLong();
  			long n = nextLong();
  			if(n % 4 == 0){
  				myout(x);
  				continue;
  			}
  			long single = ((n + 3) / 4);
  			if(Math.abs(x % 2) == 1){
  				if(n % 4 == 1){
  					x += (single - 1) * 4 + 1;
  				}else if(n % 4 == 2){
  					x--;
  				}else{
  					x -= single * 4;
  				}
  				
  			}else{
  				if(n % 4 == 1){
  					x -= (single - 1) * 4 + 1;
  				}else if(n % 4 == 2){
  					x++;
  				}else{
  					x += single * 4;
  				}
  			}
  			myout(x);
  		}
  	}
  	//メソッド追加エリア　ここから
  
  
  
  	//メソッド追加エリア　ここまで
  }
  