content: import java.io.*;
  import java.math.*;
  import java.security.*;
  import java.text.*;
  import java.util.*;
  import java.util.concurrent.*;
  import java.util.regex.*;
  
  public class Solution {
  
      
      // The index of last prisoner who gets the last piece of candy is m + s - 1 .
      // But if this index becomes larger than the number of prisoners , then we have to start traversing from the beginning (since we are moving in a circle), hence it is required to find modulus of this sum.
      // Increment by 1 , since starting index is 1. 
  
      //Method to find the index.
      static int saveThePrisoner(int n, int m, int s) {
          int index = (m + s - 2)% n +1 ;
          return index;
  
      }
  
      private static final Scanner scanner = new Scanner(System.in);
  
      public static void main(String[] args) throws IOException {
          BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
  
          int t = scanner.nextInt();
          scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
  
          for (int tItr = 0; tItr < t; tItr++) {
              String[] nms = scanner.nextLine().split(" ");
  
              int n = Integer.parseInt(nms[0]);
  
              int m = Integer.parseInt(nms[1]);
  
              int s = Integer.parseInt(nms[2]);
  
              int result = saveThePrisoner(n, m, s);
  
              bufferedWriter.write(String.valueOf(result));
              bufferedWriter.newLine();
          }
  
          bufferedWriter.close();
  
          scanner.close();
      }
  }