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: /*
          "Everything in the universe is balanced. Every disappointment
                  you face in life will be balanced by something good for you!
                          Keep going, never give up."
  
          "Just have Patience + 1..."
  
  */
  
  
  
  import java.util.*;
  import java.lang.*;
  import java.io.*;
  
  public class Solution {
      static int INF = 1000000007;
      public static void main(String[] args) throws java.lang.Exception {
          out = new PrintWriter(new BufferedOutputStream(System.out));
          sc = new FastReader();
  
          int test = sc.nextInt();
          for (int t = 0; t < test; t++) {
              solve();
          }
          out.close();
      }
  
      private static void solve() {
          int shops = sc.nextInt();
          int friends = sc.nextInt();
          int[][] joy = new int[shops][friends];
          for (int shop = 0; shop < shops; shop++) {
              for (int friend = 0; friend < friends; friend++) {
                  joy[shop][friend] = sc.nextInt();
              }
          }
          int low = 1, high = INF;
          while (low < high) {
              int mid = (low + high + 1) >> 1;
              if (isPossibleMinJoy(joy, shops, friends, mid)) {
                  low = mid;
              }else {
                  high = mid - 1;
              }
          }
          out.println(low);
      }
  
      private static boolean isPossibleMinJoy(int[][] joy, int shops, int friends, int minJoy) {
          boolean[] possible = new boolean[friends];
          boolean twoGiftsFromOneShop = false;
          for (int shop = 0; shop < shops; shop++) {
              int friendsSatisfying = 0;
              for (int friend = 0; friend < friends; friend++) {
                  if (joy[shop][friend] >= minJoy) {
                      friendsSatisfying++;
                      possible[friend] = true;
                  }
              }
              twoGiftsFromOneShop |= friendsSatisfying >= 2;
          }
          if (!twoGiftsFromOneShop) {
              return false;
          }
          for (int friend = 0; friend < friends; friend++) {
              if (!possible[friend]) {
                  return false;
              }
          }
          return true;
      }
  
  
      public static FastReader sc;
      public static PrintWriter out;
      static class FastReader
      {
          BufferedReader br;
          StringTokenizer str;
  
          public FastReader()
          {
              br = new BufferedReader(new
                      InputStreamReader(System.in));
          }
  
          String next()
          {
              while (str == null || !str.hasMoreElements())
              {
                  try
                  {
                      str = new StringTokenizer(br.readLine());
                  }
                  catch (IOException  end)
                  {
                      end.printStackTrace();
                  }
              }
              return str.nextToken();
          }
  
          int nextInt()
          {
              return Integer.parseInt(next());
          }
  
          long nextLong()
          {
              return Long.parseLong(next());
          }
  
          double nextDouble()
          {
              return Double.parseDouble(next());
          }
  
          String nextLine()
          {
              String str = "";
              try
              {
                  str = br.readLine();
              }
              catch (IOException end)
              {
                  end.printStackTrace();
              }
              return str;
          }
      }
  }