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.io.BufferedReader;
      import java.io.FileInputStream;
      import java.io.FileNotFoundException;
      import java.io.IOException;
      import java.io.InputStreamReader;
      import java.util.*;
  import java.util.concurrent.LinkedBlockingDeque;
  import java.io.PrintStream;
      import java.io.PrintWriter;
      import java.io.DataInputStream;
  
          public class Solution {
  
              //TEMPLATE -------------------------------------------------------------------------------------
  
              public static boolean Local(){
                  try{ 
                      return System.getenv("LOCAL_SYS")!=null;
                  }catch(Exception e){
                      return false;
                  }
              }   
  
              public static boolean LOCAL;
  
              static class FastScanner {
  
                      BufferedReader br;
                      StringTokenizer st ;
  
                      FastScanner(){
                          br =  new BufferedReader(new InputStreamReader(System.in));
                          st = new StringTokenizer("");
                      }
  
                      FastScanner(String file) {
  
                          try{
                              br =  new BufferedReader(new InputStreamReader(new FileInputStream(file)));
                              st = new StringTokenizer("");
                          }catch(FileNotFoundException e) {
                              // TODO Auto-generated catch block
                              System.out.println("file not found");
                              e.printStackTrace();
                          }
                          
                      }
                      String next() {
                          while (!st.hasMoreTokens())
                              try {
                                  st = new StringTokenizer(br.readLine());
                              } catch (IOException e) {
                              }
                          return st.nextToken();
                      }
                      int nextInt() {
                          return Integer.parseInt(next());
                      }
                      long nextLong() {
                          return Long.parseLong(next());
                      }
                      String readLine() throws IOException{
                          return br.readLine();
                      }
                  }
                                      
              static class Pair<T,X> {
  
                  T first;
                  X second;
                  
                  Pair(T first,X second){
                      this.first = first;
                      this.second = second;
                  }
  
                  @Override
                  public int hashCode(){
                      return Objects.hash(first,second);
                  }
  
                  @Override
                  public boolean equals(Object obj){
                      return obj.hashCode() == this.hashCode();
                  }
  
              }
  
          
          static PrintStream debug = null;
          
          
          static long mod = (long)(Math.pow(10,9) + 7); 
         //TEMPLATE -------------------------------------------------------------------------------------END//
          public static void main(String[] args) throws Exception {
              
              FastScanner s = new FastScanner();
              LOCAL = Local();
              //PrintWriter pw = new PrintWriter(System.out);
              if(LOCAL){
                  s = new FastScanner("src/input.txt");
                  PrintStream o = new PrintStream("src/sampleout.txt");
                  debug = new PrintStream("src/debug.txt");
                  System.setOut(o);
              //  pw = new PrintWriter(o);
              } long mod = 1000000007;
  
          
              int tcr = s.nextInt();                  
              
              StringBuilder sb = new StringBuilder();
  
              for(int tc=0;tc<tcr;tc++){
                  long x = s.nextLong();
                  long n = s.nextLong();
                  long time = n; 
                  n = (n % 4);
                  time -= n;
                  time++;
                  for(int i=0;i<n;i++){
                      if((Math.abs(x) % 2) == 0l){
                          x = x - time;
                      }else{
                          x = x + time;
                      }
                      time++;
                  }
                  sb.append(x+"\n");
              }    
  
  
              print(sb.toString());
          }
  
          public static void dec(TreeMap<Integer,Integer> map,int n){
              int cnt = map.get(n);
              if(cnt == 1){map.remove(n);return;}
              map.put(n,cnt - 1);
          }
   
          
  
          public static List<int[]> print_prime_factors(int n){
          
              List<int[]> list = new ArrayList<>();
              
              for(int i=2;i<=(int)(Math.sqrt(n));i++){
      
                  if(n % i == 0){
                      
                      int cnt = 0;
                      
                      while( (n % i) == 0){
                          n = n/i;
                          cnt++;
                      }
      
                      list.add(new int[]{i,cnt});
                  }
              }
      
              if(n!=1){
                  list.add(new int[]{n,1});
              }
  
              return list;
          }
  
          public static List<int[]> prime_factors(int n,List<Integer> sieve){
              List<int[]> list = new ArrayList<>();
              int index = 0;
              while(n > 1 && sieve.get(index) <= Math.sqrt(n)){
                  int curr = sieve.get(index);
                  int cnt = 0;
                  while((n % curr) == 0){
                      n = n/curr;
                      cnt++;
                  }
                  if(cnt >= 1){
                      list.add(new int[]{curr,cnt});
                  }
                  index++;
              }
              if(n > 1){
                  list.add(new int[]{n,1});
              }
              return list;
          }
  
          public static boolean inRange(int r1,int r2,int val){
              return ((val >= r1) && (val <= r2));
          }
  
          static int len(long num){
              return Long.toString(num).length();
          }
  
          static long mulmod(long a, long b,long mod)
          {
              long ans = 0l;
              
              while(b > 0){
                  long curr = (b & 1l);
                  if(curr == 1l){
                      ans = ((ans % mod) + a) % mod;
                  }
                  
                  a = (a + a) % mod;
  
                  b = b >> 1;
              }
  
              return ans;
          }
  
  
          public static void dbg(PrintStream ps,Object... o) throws Exception{
              if(ps == null){
                  return;
              }
              Debug.dbg(ps,o);
          }
  
          public static long modpow(long num,long pow,long mod){
  
              long val = num;
              long ans = 1l;
  
              while(pow > 0l){
                  
                  long bit = pow & 1l;
  
                  if(bit == 1){
                      ans = (ans * (val%mod))%mod;
                  }
  
                  val = (val * val) % mod;
                  pow = pow >> 1;
              }
  
              return ans;
  
          }
  
          public static char get(int n){
              return (char)('a' + n);
          }
  
          public static long[] sort(long arr[]){
              List<Long> list = new ArrayList<>();
              for(long n : arr){list.add(n);}
              Collections.sort(list);
              for(int i=0;i<arr.length;i++){
                  arr[i] = list.get(i);
              }
              return arr;
          }
  
          public static int[] sort(int arr[]){
              List<Integer> list = new ArrayList<>();
              for(int n : arr){list.add(n);}
              Collections.sort(list);
              for(int i=0;i<arr.length;i++){
                  arr[i] = list.get(i);
              }
              return arr;
          }
  
          // return the (index + 1)
          // where index is the pos of just smaller element
          // i.e count of elemets strictly less than num
          public static int justSmaller(long arr[],long num){
              //  System.out.println(num+"@");
              int st = 0;
              int e = arr.length - 1;
  
              int ans = -1;
  
              while(st <= e){
  
                  int mid = (st + e)/2;
  
                  if(arr[mid] >= num){
                      e = mid - 1;
                  }else{
                      ans = mid;
                      st = mid + 1;
                  }
  
              }
  
  
              return ans + 1;
  
          }
          public static int justSmaller(int arr[],int num){
              //  System.out.println(num+"@");
              int st = 0;
              int e = arr.length - 1;
  
              int ans = -1;
  
              while(st <= e){
  
                  int mid = (st + e)/2;
  
                  if(arr[mid] >= num){
                      e = mid - 1;
                  }else{
                      ans = mid;
                      st = mid + 1;
                  }
  
              }
  
  
              return ans + 1;
  
          }
          
          //return (index of just greater element)
          //count of elements smaller than or equal to num
  
          public static int justGreater(long arr[],long num){
              int st = 0;
              int e = arr.length - 1;
  
              int ans = arr.length;
  
              while(st <= e){
                  
                  int mid = (st + e)/2;
  
                  if(arr[mid] <= num){
                      st = mid + 1;
                  }else{
                      ans = mid;
                      e = mid - 1;
                  }
              }
  
              return ans;
  
          }
  
          public static int justGreater(int arr[],int num){
              int st = 0;
              int e = arr.length - 1;
  
              int ans = arr.length;
  
              while(st <= e){
                  
                  int mid = (st + e)/2;
  
                  if(arr[mid] <= num){
                      st = mid + 1;
                  }else{
                      ans = mid;
                      e = mid - 1;
                  }
              }
  
              return ans;
  
          }
  
          
  
          public static void println(Object obj){
              System.out.println(obj.toString());
          }
  
          public static void print(Object obj){
              System.out.print(obj.toString());
          }
  
          public static int gcd(int a,int b){
              if(b == 0){return a;}
              return gcd(b,a%b);
          }
  
          public static long gcd(long a,long b){
              if(b == 0l){
                  return a;
              }
  
              return gcd(b,a%b);
          }
  
          public static int find(int parent[],int v){
              if(parent[v] == v){
                  return v;
              }
              
              return parent[v] = find(parent, parent[v]);
          }
  
  
  
          public static List<Integer> sieve(){
          
                  List<Integer> prime = new ArrayList<>();
  
                  int arr[] = new int[100001];
  
              Arrays.fill(arr,1);
  
              arr[1] = 0;
              arr[2] = 1;
  
              for(int i=2;i<=100000;i++){
                  
                  if(arr[i] == 1){
                      
                      prime.add(i);
  
                      for(long j = (i*1l*i);j<100001;j+=i){
                          arr[(int)j] = 0;
                      }
                  }
              }
  
              return prime;
          }
  
          static boolean isPower(long n,long a){
              
              long log = (long)(Math.log(n)/Math.log(a));
  
              long power = (long)Math.pow(a,log);
  
              if(power == n){return true;}
  
              return false;
          }
  
  
          private static int mergeAndCount(int[] arr, int l,int m, int r)
          {
              // Left subarray
              int[] left =  Arrays.copyOfRange(arr, l, m + 1);
  
              // Right subarray
              int[] right = Arrays.copyOfRange(arr, m + 1, r + 1);
  
              int i = 0, j = 0, k = l, swaps = 0;
  
              while (i < left.length && j < right.length) {
                  if (left[i] <= right[j])
                      arr[k++] = left[i++];
                  else {
                      arr[k++] = right[j++];
                      swaps += (m + 1) - (l + i);
                  }
              }
              while (i < left.length)
                  arr[k++] = left[i++];
              while (j < right.length)
                  arr[k++] = right[j++];
              return swaps;
          }
  
          // Merge sort function
          private static int mergeSortAndCount(int[] arr, int l,int r)
          {
  
              // Keeps track of the inversion count at a
              // particular node of the recursion tree
              int count = 0;
  
              if (l < r) {
                  int m = (l + r) / 2;
  
                  // Total inversion count = left subarray count
                  // + right subarray count + merge count
  
                  // Left subarray count
                  count += mergeSortAndCount(arr, l, m);
  
                  // Right subarray count
                  count += mergeSortAndCount(arr, m + 1, r);
  
                  // Merge count
                  count += mergeAndCount(arr, l, m, r);
              }
  
              return count;
          }
  
          static class Debug{
              //change to System.getProperty("ONLINE_JUDGE")==null; for CodeForces
              public static final boolean LOCAL = System.getProperty("ONLINE_JUDGE")==null;
  
              
  
              private static <T> String ts(T t) {
                  if(t==null) {
                      return "null";
                  }
                  try {
                      return ts((Iterable) t);
                  }catch(ClassCastException e) {
                      if(t instanceof int[]) {
                          String s = Arrays.toString((int[]) t);
                          return "{"+s.substring(1, s.length()-1)+"}\n";
                      }else if(t instanceof long[]) {
                          String s = Arrays.toString((long[]) t);
                          return "{"+s.substring(1, s.length()-1)+"}\n";
                      }else if(t instanceof char[]) {
                          String s = Arrays.toString((char[]) t);
                          return "{"+s.substring(1, s.length()-1)+"}\n";
                      }else if(t instanceof double[]) {
                          String s = Arrays.toString((double[]) t);
                          return "{"+s.substring(1, s.length()-1)+"}\n";
                      }else if(t instanceof boolean[]) {
                          String s = Arrays.toString((boolean[]) t);
                          return "{"+s.substring(1, s.length()-1)+"}\n";
                      }
                      try {
                          return ts((Object[]) t);
                      }catch(ClassCastException e1) {
                          return t.toString();
                      }
                  }
              }
              private static <T> String ts(T[] arr) {
                  StringBuilder ret = new StringBuilder();
                  ret.append("{");
                  boolean first = true;
                  for(T t: arr) {
                      if(!first) {
                          ret.append(", ");
                      }
                      first = false;
                      ret.append(ts(t));
                  }
                  ret.append("}");
                  return ret.toString();
              }
              private static <T> String ts(Iterable<T> iter) {
                  StringBuilder ret = new StringBuilder();
                  ret.append("{");
                  boolean first = true;
                  for(T t: iter) {
                      if(!first) {
                          ret.append(", ");
                      }
                      first = false;
                      ret.append(ts(t));
                  }
                  ret.append("}\n");
                  return ret.toString();
              }
              public static void dbg(PrintStream ps,Object... o) throws Exception {
                  if(LOCAL) {
                      System.setErr(ps);
                      System.err.print("Line #"+Thread.currentThread().getStackTrace()[2].getLineNumber()+": [\n");
                      for(int i = 0; i<o.length; i++) {
                          if(i!=0) {
                              System.err.print(", ");
                          }
                          System.err.print(ts(o[i]));
                      }
                      System.err.println("]");
                  }
              }
          }
  
      }