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 {
  	public static void main(String[] args) throws FileNotFoundException,IOException,Exception {
          boolean isFile = true;
          isFile &= false;
          ScanReader in;PrintWriter out;
  
          if(isFile) {
              InputStream inputStream = new FileInputStream("input.txt");
              in = new ScanReader(inputStream,new BufferedReader(new FileReader("input.txt")));
              out = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
  
          } else {
              InputStream inputStream = System.in;
              in = new ScanReader(inputStream,new BufferedReader(new InputStreamReader(System.in)));
              out = new PrintWriter(System.out);
          }
  
          Palindrome solver = new Palindrome();
  
          int t = 1;
          t = in.nextInt();
  
          for (int i = 0; i < t; i++) {
              solver.solve(i + 1, in, out);
          }
  
          out.close();
  	}
  
      static class Palindrome {
          static long mod = 1000000007;
          static long maxX = (long) 1e18;
          static long mod2 = 998244353;
  
          //  Check for boundary Condition because you are not Sehwag..
          //  For multiple Test cases take all input -> do not use return while taking input.
          //  at least check constraint for once it can be done in nested loops.
          //  Think simple and short
          //  check for proof of solution
          //  Read editorial after contest.....
  
          int n,m;
          int[][] cost;
  
          boolean check(int x) {
              boolean f = false;
  
              boolean[] temp = new boolean[m];
  
              for(int i = 0;i<n;i++) {
                  int c = 0;
                  for(int j = 0;j<m;j++) {
                      if(cost[i][j] >= x) {
                          temp[j] = true;
                          c++;
                      }
  
                      if(c>1) {
                          f = true;
                      }
                  }
              }
  
              if(!f && m>1) return false;
  
              f = true;
              for(boolean ff : temp) 
                  f &= ff;
  
              return f;
          }
  
          void solve(int testNumber, ScanReader in, PrintWriter out) throws Exception {
  
              n = in.nextInt(); 
              m = in.nextInt();
              cost = new int[n][m];
  
              for(int i = 0;i<n;i++) {
                  for(int j = 0;j<m;j++) {
                      cost[i][j] = in.nextInt();
                  }
              }
  
              int l = 1;
              int r = 2;
  
              while(check(r))
                  r *=2;
  
              while(l+1< r) {
                  int m = (l+r)/2;
  
                  if(check(m)) {
                      l = m;
                  } else {
                      r = m;
                  }
              }
  
              out.println(l);
  
          }  
      }
  
      
      static class ScanReader {
          private final InputStream stream;
          private byte[] buf = new byte[1024];
          private int curChar;
          private int numChars;
          private SpaceCharFilter filter;
          private BufferedReader br;
  
          public ScanReader(InputStream stream,BufferedReader br) {
          this.stream = stream;
              this.br = br;
          }
  
          public int read() {
              if (numChars == -1)
                  throw new InputMismatchException();
  
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = stream.read(buf);
                  } catch (IOException e) {
                      throw new InputMismatchException();
                  }
  
                  if (numChars <= 0)
                      return -1;
              }
              return buf[curChar++];
          }
  
          public String nextLine() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
  
          public int nextInt() {
              int c = read(); 
  
              while (isSpaceChar(c))
                  c = read();
  
              int sgn = 1;
  
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
  
              int res = 0;
              do {
                  if (c < '0' || c > '9')
                      throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              while (!isSpaceChar(c));
  
              return res * sgn;
          }
  
          public long nextLong() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              long res = 0;
  
              do {
                  if (c < '0' || c > '9')
                      throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              while (!isSpaceChar(c));
              return res * sgn;
          }
  
          public double nextDouble() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              double res = 0;
              while (!isSpaceChar(c) && c != '.') {
                  if (c == 'e' || c == 'E')
                      return res * Math.pow(10, nextInt());
                  if (c < '0' || c > '9')
                      throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              if (c == '.') {
                  c = read();
                  double m = 1;
                  while (!isSpaceChar(c)) {
                      if (c == 'e' || c == 'E')
                          return res * Math.pow(10, nextInt());
                      if (c < '0' || c > '9')
                          throw new InputMismatchException();
                      m /= 10;
                      res += (c - '0') * m;
                      c = read();
                  }
              }
              return res * sgn;
          }
  
          public String readString() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              StringBuilder res = new StringBuilder();
              do {
                  res.appendCodePoint(c);
                  c = read();
              }
              while (!isSpaceChar(c));
  
              return res.toString();
          }
  
          public boolean isSpaceChar(int c) {
              if (filter != null)
                  return filter.isSpaceChar(c);
              return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
          }
  
          public String next() {
              return readString();
          }
  
          public interface SpaceCharFilter {
              public boolean isSpaceChar(int ch);
          }
      }
  }