description: Vlad has n friends, for each of whom he wants to buy one gift for the New Year.
  
  There are m shops in the city, in each of which he can buy a gift for any of his friends. If the j-th friend (1 ≤ j ≤ n) receives a gift bought in the shop with the number i (1 ≤ i ≤ m), then the friend receives p_{ij} units of joy. The rectangular table p_{ij} is given in the input.
  
  Vlad has time to visit at most n-1 shops (where n is the number of friends). He chooses which shops he will visit and for which friends he will buy gifts in each of them.
  
  Let the j-th friend receive a_j units of joy from Vlad's gift. Let's find the value α=min\\{a_1, a_2, ..., a_n\}. Vlad's goal is to buy gifts so that the value of α is as large as possible. In other words, Vlad wants to maximize the minimum of the joys of his friends.
  
  For example, let m = 2, n = 2. Let the joy from the gifts that we can buy in the first shop: p_{11} = 1, p_{12}=2, in the second shop: p_{21} = 3, p_{22}=4.
  
  Then it is enough for Vlad to go only to the second shop and buy a gift for the first friend, bringing joy 3, and for the second — bringing joy 4. In this case, the value α will be equal to min\{3, 4\} = 3
  
  Help Vlad choose gifts for his friends so that the value of α is as high as possible. Please note that each friend must receive one gift. Vlad can visit at most n-1 shops (where n is the number of friends). In the shop, he can buy any number of gifts.
  
  Input
  
  The first line of the input contains an integer t (1 ≤ t ≤ 10^4) — the number of test cases in the input.
  
  An empty line is written before each test case. Then there is a line containing integers m and n (2 ≤ n, 2 ≤ n ⋅ m ≤ 10^5) separated by a space — the number of shops and the number of friends, where n ⋅ m is the product of n and m.
  
  Then m lines follow, each containing n numbers. The number in the i-th row of the j-th column p_{ij} (1 ≤ p_{ij} ≤ 10^9) is the joy of the product intended for friend number j in shop number i.
  
  It is guaranteed that the sum of the values n ⋅ m over all test cases in the test does not exceed 10^5.
  
  Output
  
  Print t lines, each line must contain the answer to the corresponding test case — the maximum possible value of α, where α is the minimum of the joys from a gift for all of Vlad's friends.
  
  Example
  
  Input
  
  
  5
  
  2 2
  1 2
  3 4
  
  4 3
  1 3 1
  3 1 1
  1 2 2
  1 1 3
  
  2 3
  5 3 4
  2 5 1
  
  4 2
  7 9
  8 1
  9 6
  10 8
  
  2 4
  6 5 2 1
  7 9 7 2
  
  
  Output
  
  
  3
  2
  4
  8
  2
solution: import java.util.*;
  import java.io.*;
  
  public class Main {
      static FastScanner sc = new FastScanner(System.in);
      static PrintWriter pw = new PrintWriter(System.out);
      static StringBuilder sb = new StringBuilder();
      static long mod = (long) 1e9 + 7;
      
      public static void main(String[] args) throws Exception {
          int n = sc.nextInt();
          for(int i = 0; i < n; i++) solve();
          pw.flush();
      }
  
      public static void solve() {
          sc.nextLine();
          int M = sc.nextInt();
          int N = sc.nextInt();
          ArrayList<ArrayList<long[]>> arr = new ArrayList<>();
          ArrayList<ArrayList<Long>> arr2 = new ArrayList<>();
          for(int i = 0; i < N; i++) arr.add(new ArrayList<>());
          for(int j = 0; j < M; j++) arr2.add(new ArrayList<>());
          for(int i = 0; i < M; i++){
              for(int j = 0; j < N; j++){
                  long v = sc.nextLong();
                  arr.get(j).add(new long[]{v,i});
                  arr2.get(i).add(v);
              }
          }
          for(int i = 0; i < N; i++){
              Collections.sort(arr.get(i),new ArrayComparator());
          }
          for(int i = 0; i < M; i++){
              Collections.sort(arr2.get(i),Comparator.reverseOrder());
          }
          long ans = Long.MAX_VALUE;
          HashSet<Long> set = new HashSet<>();
          for(int i = 0; i < N; i++){
              long v1 = arr.get(i).get(0)[0];
              long j = arr.get(i).get(0)[1];
              set.add(j);
              ans = Math.min(ans,v1);
          }
          if(set.size() == N){
              long max2 = 0;
              for(int i = 0; i < M; i++){
                  long v1 = arr2.get(i).get(1);
                  max2 = Math.max(max2,v1);
              }
              ans = Math.min(max2,ans);
          }
          pw.println(ans);
      }
      
      static class ArrayComparator implements Comparator<long[]> {
          @Override
          public int compare(long[] a1, long[] a2) {
              for (int i = 0; i < a1.length; i++) {
                  if (a1[i] > a2[i]) {
                      return -1;
                  } else if (a1[i] < a2[i]) {
                      return 1;
                  }
              }
              if (a1.length < a2.length) {
                  return -1;
              } else if (a1.length > a2.length) {
                  return 1;
              } else {
                  return 0;
              }
          }
      }
  
  
      static class GeekInteger {
          public static void save_sort(int[] array) {
              shuffle(array);
              Arrays.sort(array);
          }
  
          public static int[] shuffle(int[] array) {
              int n = array.length;
              Random random = new Random();
              for (int i = 0, j; i < n; i++) {
                  j = i + random.nextInt(n - i);
                  int randomElement = array[j];
                  array[j] = array[i];
                  array[i] = randomElement;
              }
              return array;
          }
  
          public static void save_sort(long[] array) {
              shuffle(array);
              Arrays.sort(array);
          }
  
          public static long[] shuffle(long[] array) {
              int n = array.length;
              Random random = new Random();
              for (int i = 0, j; i < n; i++) {
                  j = i + random.nextInt(n - i);
                  long randomElement = array[j];
                  array[j] = array[i];
                  array[i] = randomElement;
              }
              return array;
          }
  
      }
  }
  
  class FastScanner {
      private BufferedReader reader = null;
      private StringTokenizer tokenizer = null;
  
      public FastScanner(InputStream in) {
          reader = new BufferedReader(new InputStreamReader(in));
          tokenizer = null;
      }
  
      public FastScanner(FileReader in) {
          reader = new BufferedReader(in);
          tokenizer = null;
      }
  
      public String next() {
          if (tokenizer == null || !tokenizer.hasMoreTokens()) {
              try {
                  tokenizer = new StringTokenizer(reader.readLine());
              } catch (IOException e) {
                  throw new RuntimeException(e);
              }
          }
          return tokenizer.nextToken();
      }
  
      public String nextLine() {
          if (tokenizer == null || !tokenizer.hasMoreTokens()) {
              try {
                  return reader.readLine();
              } catch (IOException e) {
                  throw new RuntimeException(e);
              }
          }
          return tokenizer.nextToken("\n");
      }
  
      public long nextLong() {
          return Long.parseLong(next());
      }
  
      public int nextInt() {
          return Integer.parseInt(next());
      }
  
      public double nextDouble() {
          return Double.parseDouble(next());
      }
  
      public String[] nextArray(int n) {
          String[] a = new String[n];
          for (int i = 0; i < n; i++)
              a[i] = next();
          return a;
      }
  
      public int[] nextIntArray(int n) {
          int[] a = new int[n];
          for (int i = 0; i < n; i++)
              a[i] = nextInt();
          return a;
      }
  
      public long[] nextLongArray(int n) {
          long[] a = new long[n];
          for (int i = 0; i < n; i++)
              a[i] = nextLong();
          return a;
      }
  }
  