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.OutputStream;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.OutputStream;
  import java.io.PrintWriter;
  import java.io.BufferedWriter;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.ArrayList;
  import java.util.Objects;
  import java.util.StringTokenizer;
  import java.io.Writer;
  import java.io.OutputStreamWriter;
  import java.io.BufferedReader;
  import java.util.Collections;
  import java.io.InputStream;
  
  /**
   * Built using CHelper plug-in
   * Actual solution is at the top
   */
  public class Main {
      public static void main(String[] args) {
          InputStream inputStream = System.in;
          OutputStream outputStream = System.out;
          InputReader in = new InputReader(inputStream);
          OutputWriter out = new OutputWriter(outputStream);
          DNewYearsProblem solver = new DNewYearsProblem();
          int testCount = Integer.parseInt(in.next());
          for (int i = 1; i <= testCount; i++)
              solver.solve(i, in, out);
          out.close();
      }
  
      static class DNewYearsProblem {
          int m;
          int n;
          int[][] arr;
          int[] max;
          int min;
          ArrayList<Pair> list;
  
          public void solve(int testNumber, InputReader in, OutputWriter out) {
              m = in.nextInt();
              n = in.nextInt();
              arr = in.nextIntMatrix(m, n);
              max = new int[n];
              min = Integer.MAX_VALUE;
              list = new ArrayList<>();
              for (int i = 0; i < m; i++) {
                  for (int j = 0; j < n; j++) {
                      list.add(new Pair(arr[i][j], i, j));
                  }
              }
              for (int i = 0; i < n; i++) {
                  for (int j = 0; j < m; j++) {
                      max[i] = Math.max(max[i], arr[j][i]);
                  }
                  min = Math.min(min, max[i]);
              }
  //        out.println(max);
              Collections.sort(list);
              int lo = 0;
              int hi = list.size() - 1;
              int ans = 0;
              while (lo <= hi) {
                  int mid = (lo + hi) / 2;
                  if (check(mid)) {
                      lo = mid + 1;
                      ans = list.get(mid).a;
                  } else {
                      hi = mid - 1;
                  }
              }
              out.println(ans);
          }
  
          boolean check(int mid) {
              Pair p = list.get(mid);
              if (p.a > min) return false;
              for (int i = 0; i < m; i++) {
                  int c = 0;
                  boolean flag = false;
                  for (int j = 0; j < n; j++) {
                      if (arr[i][j] >= p.a) {
                          flag = true;
                          c++;
                      }
                  }
                  if (flag && c >= 2) return true;
              }
  
              return false;
          }
  
          class Pair implements Comparable<Pair> {
              int a;
              int b;
              int c;
  
              Pair(int a, int b, int c) {
                  this.a = a;
                  this.b = b;
                  this.c = c;
              }
  
              public int hashCode() {
                  return Objects.hash(a, b);
              }
  
              public boolean equals(Object obj) {
                  Pair that = (Pair) obj;
                  return a == that.a && b == that.b;
              }
  
              public String toString() {
                  return "[" + a + ", " + b + "]";
              }
  
              public int compareTo(Pair v) {
                  return a - v.a;
              }
  
          }
  
      }
  
      static class OutputWriter {
          private final PrintWriter writer;
  
          public OutputWriter(OutputStream outputStream) {
              writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
          }
  
          public OutputWriter(Writer writer) {
              this.writer = new PrintWriter(writer);
          }
  
          public void close() {
              writer.close();
          }
  
          public void println(int i) {
              writer.println(i);
          }
  
      }
  
      static class InputReader {
          BufferedReader reader;
          StringTokenizer tokenizer;
  
          public InputReader(InputStream stream) {
              reader = new BufferedReader(new InputStreamReader(stream), 32768);
              tokenizer = null;
          }
  
          public String next() {
              while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                  try {
                      tokenizer = new StringTokenizer(reader.readLine());
                  } catch (IOException e) {
                      throw new RuntimeException(e);
                  }
              }
              return tokenizer.nextToken();
          }
  
          public int nextInt() {
              return Integer.parseInt(next());
          }
  
          public int[][] nextIntMatrix(int rows, int cols) {
              int[][] matrix = new int[rows][cols];
              for (int i = 0; i < rows; i++)
                  for (int j = 0; j < cols; j++)
                      matrix[i][j] = nextInt();
              return matrix;
          }
  
      }
  }
  
  