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.io.*;
  import java.util.*;
  
  public class Main {
      class JoinSet {
          int[] fa;
  
          JoinSet(int n) {
              fa = new int[n];
              for (int i = 0; i < n; i++) fa[i] = i;
          }
  
          int find(int x) {
              if (x != fa[x]) fa[x] = find(fa[x]);
              return fa[x];
          }
  
          void join(int x, int y) {
              x = find(x);
              y = find(y);
              fa[x] = y;
          }
      }
      static BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
      static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
      static int mod = (int) 1e9 + 7;
      static boolean[] isprime = new boolean[1];
      static {
          for (int i = 2; i < isprime.length; i++) isprime[i] = true;
          for (int i = 2; i < isprime.length; i++) {
              if (isprime[i]) {
                  for (int k = 2; i * k < isprime.length; k++) {
                      isprime[i * k] = false;
                  }
              }
          }
      }
      public static long gcd(long a, long b) {
          return b == 0 ? a : gcd(b, a % b);
      }
      public static long lcm(long a, long b) {
          return a * b / gcd(a, b);
      }
      public static int get() throws Exception {
          String ss = bf.readLine();
          if (ss.contains(" ")) ss = ss.substring(0, ss.indexOf(" "));
          return Integer.parseInt(ss);
      }
      public static int[] getInt() throws Exception {
          String s[] = bf.readLine().split(" ");
          int[] a = new int[s.length];
          for (int i = 0; i < a.length; i++) {
              a[i] = Integer.parseInt(s[i]);
          }
          return a;
      }
      public static long[] getLong() throws Exception {
          String s[] = bf.readLine().split(" ");
          long[] a = new long[s.length];
          for (int i = 0; i < a.length; i++) {
              a[i] = Long.parseLong(s[i]);
          }
          return a;
      }
      public static void print(int[] a) throws Exception {
          for (int i : a) {
              bw.write(i + " ");
          }
          println();
      }
      public static void print(long[] a) throws Exception {
          for (long i : a) {
              bw.write(i + " ");
          }
          println();
      }
      public static void print(String a) throws Exception {
          bw.write(a + "\n");
      }
      public static void print(int a) throws Exception {
          bw.write(a + "\n");
      }
      public static void println() throws Exception {
          bw.write("\n");
      }
      public static long pow(long a, long b) {
          long ans = 1;
          while (b > 0) {
              if ((b & 1) == 1) {
                  ans *= a;
              }
              a *= a;
              b >>= 1;
          }
          return ans;
      }
      public static int powmod(long a, long b, int mod) {
          long ans = 1;
          while (b > 0) {
              if ((b & 1) == 1) {
                  ans = ans * a % mod;
              }
              a = a * a % mod;
              b >>= 1;
          }
          return (int) ans;
      }
      public static void sort(int[] a) {
          int n = a.length;
          Integer[] b = new Integer[n];
          for (int i = 0; i < n; i++) b[i] = a[i];
          Arrays.sort(b);
          for (int i = 0; i < n; i++) a[i] = b[i];
      }
  
      public static void main(String[] args) throws Exception {
          int t = get();
          while (t-- > 0) {
              bf.readLine();
              int[] tt = getInt();
              int m = tt[0], n = tt[1];
              int[][] a = new int[m][n];
              for(int i = 0;i < m;i++) a[i] = getInt();
              int i = 1, j = (int)1e9;
              while (i < j){
                  int mid = (i+j+1)>>1;
                  if(check(a,mid)){
                      i = mid;
                  }else{
                      j = mid-1;
                  }
              }
              print(i);
          }
          bw.flush();
      }
  
      public static boolean check(int[][] a, int m){
          boolean ok = true;
          for(int j = 0;j < a[0].length;j++){
              boolean f = false;
              for(int i = 0;i < a.length;i++){
                  if(a[i][j] >= m) {
                      f = true;
                  }
              }
              if(!f) {
                  ok = false;
                  break;
              }
          }
          if(ok){
              ok = false;
              for(int i = 0;i < a.length;i++){
                  int cnt = 0;
                  for(int j = 0;j < a[0].length;j++){
                      if(a[i][j] >= m) {
                          cnt++;
                      }
                  }
                  if(cnt > 1) {
                      ok = true;
                      break;
                  }
              }
          }
          return ok;
      }
  }