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.math.BigInteger;
  import java.util.Arrays;
  import java.util.InputMismatchException;
  import java.util.Scanner;
  import java.util.StringTokenizer;
  
  public class D_1619 {
      static int shops = 0;
      static int friends = 0;
  
      public static void main(String[] args) throws FileNotFoundException {
  //        Scanner sc = new Scanner(new File("CodeForce_1619/test.txt"));
          FastScanner sc = new FastScanner(System.in);
          int cases = sc.nextInt();
          while (cases-- > 0){
              solve(sc);
          }
      }
  
      public static void solve(FastScanner sc){
          shops = sc.nextInt();
          friends = sc.nextInt();
  
          Pair[][] values = new Pair[friends][shops];
  
          for(int i = 0;i<shops;i++){
              for(int j = 0;j<friends;j++){
                  values[j][i] = new Pair(sc.nextInt(), i);        // checked read in to array
              }
          }
  
          int l = 1;
          int r = Integer.MAX_VALUE;
  
          for(int i = 0;i<friends;i++){
              Arrays.sort(values[i]);                 // checked sort
              if(values[i][0].x < r) r = values[i][0].x;   // checked bound
          }
  
          System.out.println(check(values,l,r));
      }
  
      public static int check(Pair[][] values,int l,int r){
          int tmp=0;
          while (l <= r){
              int mid = (l+r) / 2;
              if(check(values,mid)){
                  tmp = mid;
                  l=mid+1;
              } else{
                  r=mid-1;
              }
          }
          return tmp;
  
  //        if(r < l) return r;
  //        int mid = (l+r) / 2;
  //        if(check(values,mid)){
  //            l=mid;
  //            return check(values,l,r);
  //        } else{
  //            r = mid;
  //            return check(values,l,r);
  //        }
  
  
      }
  
      public static boolean check(Pair[][] values,int pij){
          int[] vis = new int[shops];
          for(int i = 0; i < friends;i++){
              for(int j = 0;j<shops;j++){
                  if(values[i][j].x >= pij) vis[values[i][j].y]++;
                  if(vis[values[i][j].y]>= 2) return true;
              }
          }
          return false;
      }
  
  }
  class Pair implements Comparable<Pair>{
      int x;
      int y;
      public  Pair(int x,int y){
          this.x = x;
          this.y = y;
      }
  
  
      @Override
      public int compareTo(Pair o) {
          return -(this.x - o.x);
      }
  }
  class FastScanner {
      private boolean finished = false;
  
      private InputStream stream;
      private byte[] buf = new byte[1024];
      private int curChar;
      private int numChars;
      private SpaceCharFilter filter;
  
      public FastScanner(InputStream stream) {
          this.stream = stream;
      }
  
      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 int peek() {
          if (numChars == -1) {
              return -1;
          }
          if (curChar >= numChars) {
              curChar = 0;
              try {
                  numChars = stream.read(buf);
              } catch (IOException e) {
                  return -1;
              }
              if (numChars <= 0) {
                  return -1;
              }
          }
          return buf[curChar];
      }
  
      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 String nextString() {
          int c = read();
          while (isSpaceChar(c)) {
              c = read();
          }
          StringBuilder res = new StringBuilder();
          do {
              if (Character.isValidCodePoint(c)) {
                  res.appendCodePoint(c);
              }
              c = read();
          } while (!isSpaceChar(c));
          return res.toString();
      }
  
      public boolean isSpaceChar(int c) {
          if (filter != null) {
              return filter.isSpaceChar(c);
          }
          return isWhitespace(c);
      }
  
      public static boolean isWhitespace(int c) {
          return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
      }
  
      private String readLine0() {
          StringBuilder buf = new StringBuilder();
          int c = read();
          while (c != '\n' && c != -1) {
              if (c != '\r') {
                  buf.appendCodePoint(c);
              }
              c = read();
          }
          return buf.toString();
      }
      public String readLine() {
          String s = readLine0();
          while (s.trim().length() == 0) {
              s = readLine0();
          }
          return s;
      }
      public String readLine(boolean ignoreEmptyLines) {
          if (ignoreEmptyLines) {
              return readLine();
          } else {
              return readLine0();
          }
      }
  
      public BigInteger readBigInteger() {
          try {
              return new BigInteger(nextString());
          } catch (NumberFormatException e) {
              throw new InputMismatchException();
          }
      }
  
      public char nextCharacter() {
          int c = read();
          while (isSpaceChar(c)) {
              c = read();
          }
          return (char) c;
      }
  
      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 boolean isExhausted() {
          int value;
          while (isSpaceChar(value = peek()) && value != -1) {
              read();
          }
          return value == -1;
      }
      public String next() {
          return nextString();
      }
  
      public SpaceCharFilter getFilter() {
          return filter;
      }
  
      public void setFilter(SpaceCharFilter filter) {
          this.filter = filter;
      }
  
      public interface SpaceCharFilter {
          public boolean isSpaceChar(int ch);
      }
  }
  