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.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.PrintStream;
  import java.io.File;
  import java.io.FileInputStream;
  import java.util.*;
  
  public class Main {
  
      // static final File ip = new File("input.txt");
      // static final File op = new File("output.txt");
      // static {
      //     try {
      //         System.setOut(new PrintStream(op));
      //         System.setIn(new FileInputStream(ip));
      //     } catch (Exception e) {
      //     }
      // }
  
      public static void main(String[] args) {
          FastReader sc = new FastReader();
          // int test = 1;
          int test = sc.nextInt();
          while (test-- > 0) {
              int m = sc.nextInt();
              int n = sc.nextInt();
              long[][] mat = new long[m + 1][n + 1];
              long[] max = new long[n + 1];
              for (int i = 1; i <= m; i++) {
                  for (int j = 1; j <= n; j++) {
                      mat[i][j] = sc.nextLong();
                      max[j] = Math.max(max[j], mat[i][j]);
                  }
              }
              long ans = max[1];
              for (int i = 2; i <= n; i++)
                  ans = Math.min(ans, max[i]);
              if (m <= n - 1) {
                  System.out.println(ans);
                  continue;
              }
              long val = 0;
              for (long[] a : mat) {
                  Arrays.sort(a);
                  val = Math.max(val, a[n - 1]);
              }
              System.out.println(Math.min(ans, val));
          }
      }
  
      static long power(long x, long y, long p) {
          long res = 1;
          x = x % p;
          if (x == 0)
              return 0;
          while (y > 0) {
              if ((y & 1) != 0)
                  res = (res * x) % p;
              y = y >> 1;
              x = (x * x) % p;
          }
          return res;
      }
  
      public static int countSetBits(long number) {
          int count = 0;
          while (number > 0) {
              ++count;
              number &= number - 1;
          }
          return count;
      }
  
      static int lower_bound(long target, long[] a, int pos) {
          if (pos >= a.length)
              return -1;
          int low = pos, high = a.length - 1;
          while (low < high) {
              int mid = low + (high - low) / 2;
              if (a[mid] < target)
                  low = mid + 1;
              else
                  high = mid;
          }
          return a[low] >= target ? low : -1;
      }
  
      private static <T> void swap(int[] a, int i, int j) {
          int tmp = a[i];
          a[i] = a[j];
          a[j] = tmp;
      }
  
      static class pair {
          long a;
          int b;
  
          pair(long x, int y) {
              this.a = x;
              this.b = y;
          }
      }
  
      static class first implements Comparator<pair> {
  
          public int compare(pair p1, pair p2) {
              if (p1.a > p2.a)
                  return 1;
              else if (p1.a < p2.a)
                  return -1;
              return 0;
          }
      }
  
      static class second implements Comparator<pair> {
  
          public int compare(pair p1, pair p2) {
              if (p1.b > p2.b)
                  return 1;
              else if (p1.b < p2.b)
                  return -1;
              return 0;
          }
      }
  
      private static long getSum(int[] array) {
          long sum = 0;
          for (int value : array) {
              sum += value;
          }
          return sum;
      }
  
      private static boolean isPrime(Long x) {
          if (x < 2)
              return false;
          for (long d = 2; d * d <= x; ++d) {
              if (x % d == 0)
                  return false;
          }
          return true;
      }
  
      static int[] reverse(int a[]) {
          int n = a.length;
          int i, k;
          int t;
          for (i = 0; i < n / 2; i++) {
              t = a[i];
              a[i] = a[n - i - 1];
              a[n - i - 1] = t;
          }
          return a;
      }
  
      private static boolean isPrimeInt(int x) {
          if (x < 2)
              return false;
          for (int d = 2; d * d <= x; ++d) {
              if (x % d == 0)
                  return false;
          }
          return true;
      }
  
      public static String reverse(String input) {
          StringBuilder str = new StringBuilder("");
  
          for (int i = input.length() - 1; i >= 0; i--) {
              str.append(input.charAt(i));
          }
  
          return str.toString();
      }
  
      private static int[] getPrimes(int n) {
          boolean[] used = new boolean[n + 1];
          used[0] = used[1] = true;
          // int size = 0;
          for (int i = 2; i <= n; ++i) {
              if (!used[i]) {
                  // ++size;
                  for (int j = 2 * i; j <= n; j += i) {
                      used[j] = true;
                  }
              }
          }
          int[] primes = new int[n + 1];
          for (int i = 0; i <= n; ++i) {
              if (!used[i]) {
                  primes[i] = 1;
              }
          }
          return primes;
      }
  
      private static long lcm(long a, long b) {
          return a / gcd(a, b) * b;
      }
  
      private static long gcd(long a, long b) {
          return (a == 0 ? b : gcd(b % a, a));
      }
  
      static void sortI(int[] arr) {
          int n = arr.length;
          Random rnd = new Random();
          for (int i = 0; i < n; ++i) {
              int tmp = arr[i];
              int randomPos = i + rnd.nextInt(n - i);
              arr[i] = arr[randomPos];
              arr[randomPos] = tmp;
          }
          Arrays.sort(arr);
      }
  
      static void shuffleList(ArrayList<Long> arr) {
          int n = arr.size();
          Random rnd = new Random();
          for (int i = 0; i < n; ++i) {
              long tmp = arr.get(i);
              int randomPos = i + rnd.nextInt(n - i);
              arr.set(i, arr.get(randomPos));
              arr.set(randomPos, tmp);
          }
      }
  
      static void factorize(long n) {
          int count = 0;
          while (!(n % 2 > 0)) {
              n >>= 1;
  
              count++;
          }
          if (count > 0) {
              // System.out.println("2" + " " + count);
          }
          long i = 0;
          for (i = 3; i <= (long) Math.sqrt(n); i += 2) {
              count = 0;
              while (n % i == 0) {
                  count++;
                  n = n / i;
              }
              if (count > 0) {
                  // System.out.println(i + " " + count);
              }
          }
  
          if (n > 2) {
              // System.out.println(i + " " + count);
          }
      }
  
      static void sortL(long[] arr) {
          int n = arr.length;
          Random rnd = new Random();
          for (int i = 0; i < n; ++i) {
              long tmp = arr[i];
              int randomPos = i + rnd.nextInt(n - i);
              arr[i] = arr[randomPos];
              arr[randomPos] = tmp;
          }
          Arrays.sort(arr);
      }
  
      ////////////////////////////////// DSU START ///////////////////////////
  
      static class DSU {
          int[] parent, rank, total_Elements;
  
          DSU(int n) {
              parent = new int[n + 1];
              rank = new int[n + 1];
              total_Elements = new int[n + 1];
              for (int i = 0; i <= n; i++) {
                  parent[i] = i;
                  rank[i] = 1;
                  total_Elements[i] = 1;
              }
          }
  
          int find(int u) {
              if (parent[u] == u)
                  return u;
              return parent[u] = find(parent[u]);
          }
  
          void unionByRank(int u, int v) {
              int pu = find(u);
              int pv = find(v);
  
              if (pu != pv) {
                  if (rank[pu] > rank[pv]) {
                      parent[pv] = pu;
                      total_Elements[pu] += total_Elements[pv];
                  } else if (rank[pu] < rank[pv]) {
                      parent[pu] = pv;
                      total_Elements[pv] += total_Elements[pu];
                  } else {
                      parent[pu] = pv;
                      total_Elements[pv] += total_Elements[pu];
                      rank[pv]++;
                  }
              }
          }
  
          boolean unionBySize(int u, int v) {
              u = find(u);
              v = find(v);
              if (u != v) {
                  parent[u] = v;
                  total_Elements[v] += total_Elements[u];
                  total_Elements[u] = 0;
                  return true;
              }
              return false;
          }
      }
  
      ////////////////////////////////// DSU END /////////////////////////////
  
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
  
          public FastReader() {
              br = new BufferedReader(new InputStreamReader(System.in));
          }
  
          public boolean hasNext() {
              return false;
          }
  
          String next() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.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 e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
  }