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.InputStreamReader;
  import java.util.StringTokenizer;
  import java.util.*;
  import java.io.*;
  public class Main {
      // Graph
      // prefix sums
      //inputs
      public static void main(String args[])throws Exception{
          Input sc=new Input();
          precalculates p=new precalculates();
          StringBuilder sb=new StringBuilder();
          int t=sc.readInt();
          for(int f=0;f<t;f++){
              String str=sc.readString();
              int d[]=sc.readArray();
              int m,n;
              m=d[0];n=d[1];
              int arr[][]=sc.read2dArray(m,n);
              int a[]=new int[n];
              for(int i=0;i<n;i++){
                  int max=0;
                  for(int j=0;j<m;j++){
                      max=Math.max(max,arr[j][i]);
                  }
                  a[i]=max;
              }
              //Arrays.sort(a);
              int fin=0;
              if(m>=n){
              for(int i=0;i<m;i++){
                  int ans=Integer.MAX_VALUE;
                  PriorityQueue<pair> q=new PriorityQueue<>();
                  for(int j=0;j<n;j++){
                      q.add(new pair(arr[i][j],j));
                  }
                  HashSet<Integer> set=new HashSet<>();
                  set.add(q.poll().friend);
                  set.add(q.poll().friend);
  
                  for(Integer j:set){
                      ans=Math.min(ans,arr[i][j]);
                  }
                  //System.out.println(i+" "+set+" "+ans);
                  for(int j=0;j<n;j++){
                      if(!set.contains(j)){
                          ans=Math.min(a[j],ans);
                      }
                  }
                  fin=Math.max(ans,fin);
              }
              }
              else
              {
                  fin=Integer.MAX_VALUE;
                  for(int i=0;i<n;i++){
                      fin=Math.min(a[i],fin);
                  }
              }
  
              sb.append(fin+"\n");
          }
          System.out.print(sb);
      }
  }
  class pair implements Comparable<pair>{
      int val;
      int friend;
      @Override
      public int compareTo(pair o) {
          //if(o.val!=this.val)
          return o.val-this.val;
  
      }
  
      public pair(int val, int friend) {
          this.val = val;
          //this.shop = shop;
          this.friend = friend;
      }
  }
  class Input{
      BufferedReader br;
      StringTokenizer st;
      Input(){
          br=new BufferedReader(new InputStreamReader(System.in));
          st=new StringTokenizer("");
      }
      public int[] readArray() throws Exception{
          st=new StringTokenizer(br.readLine());
          int a[]=new int[st.countTokens()];
          for(int i=0;i<a.length;i++){
              a[i]=Integer.parseInt(st.nextToken());
          }
          return a;
      }
      public long[] readArrayLong() throws Exception{
          st=new StringTokenizer(br.readLine());
          long a[]=new long[st.countTokens()];
          for(int i=0;i<a.length;i++){
              a[i]=Long.parseLong(st.nextToken());
          }
          return a;
      }
      public int readInt() throws Exception{
          st=new StringTokenizer(br.readLine());
          return Integer.parseInt(st.nextToken());
      }
      public long readLong() throws Exception{
          st=new StringTokenizer(br.readLine());
          return Long.parseLong(st.nextToken());
      }
      public String readString() throws Exception{
          return br.readLine();
      }
      public int[][] read2dArray(int n,int m)throws Exception{
          int a[][]=new int[n][m];
          for(int i=0;i<n;i++){
              st=new StringTokenizer(br.readLine());
              for(int j=0;j<m;j++){
                  a[i][j]=Integer.parseInt(st.nextToken());
              }
          }
          return a;
      }
  }
  class precalculates{
      public long gcd(long p, long q) {
          if (q == 0) return p;
          else return gcd(q, p % q);
      }
      public int[] prefixSumOneDimentional(int a[]){
          int n=a.length;
          int dp[]=new int[n];
          for(int i=0;i<n;i++){
              if(i==0)
                  dp[i]=a[i];
              else
                  dp[i]=dp[i-1]+a[i];
          }
          return dp;
      }
      public int[] postSumOneDimentional(int a[]) {
          int n = a.length;
          int dp[] = new int[n];
          for (int i = n - 1; i >= 0; i--) {
              if (i == n - 1)
                  dp[i] = a[i];
              else
                  dp[i] = dp[i + 1] + a[i];
          }
          return dp;
      }
      public int[][] prefixSum2d(int a[][]){
          int n=a.length;int m=a[0].length;
          int dp[][]=new int[n+1][m+1];
          for(int i=1;i<=n;i++){
              for(int j=1;j<=m;j++){
                  dp[i][j]=a[i-1][j-1]+dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1];
              }
          }
          return dp;
      }
      public long pow(long a,long b){
          long mod=1000000007;
          long ans=1;
          if(b<=0)
              return 1;
          if(b%2==0){
              ans=pow(a,b/2)%mod;
              return ((ans%mod)*(ans%mod))%mod;
          }else{
              ans=pow(a,b-1)%mod;
              return ((a%mod)*(ans%mod))%mod;
          }
      }
  
  }
  class GraphInteger{
      HashMap<Integer,vertex> vtces;
      class vertex{
          HashMap<Integer,Integer> children;
          public vertex(){
              children=new HashMap<>();
          }
      }
      public GraphInteger(){
          vtces=new HashMap<>();
      }
      public void addVertex(int a){
          vtces.put(a,new vertex());
      }
      public void addEdge(int a,int b,int cost){
          if(!vtces.containsKey(a)){
              vtces.put(a,new vertex());
          }
          if(!vtces.containsKey(b)){
              vtces.put(b,new vertex());
          }
          vtces.get(a).children.put(b,cost);
  //        vtces.get(b).children.put(a,cost);
      }
      public boolean isCyclicDirected(){
          boolean isdone[]=new boolean[vtces.size()+1];
          boolean check[]=new boolean[vtces.size()+1];
          for(int i=1;i<=vtces.size();i++) {
              if (!isdone[i] && isCyclicDirected(i,isdone, check)) {
                  return true;
              }
          }
          return false;
      }
      private boolean isCyclicDirected(int i,boolean isdone[],boolean check[]){
          if(check[i])
              return true;
          if(isdone[i])
              return false;
          check[i]=true;
          isdone[i]=true;
          Set<Integer> set=vtces.get(i).children.keySet();
          for(Integer ii:set){
              if(isCyclicDirected(ii,isdone,check))
                  return true;
          }
          check[i]=false;
          return false;
      }
  }
  class union_find {
      int n;
      int[] sz;
      int[] par;
  
      union_find(int nval) {
          n = nval;
          sz = new int[n + 1];
          par = new int[n + 1];
          for (int i = 0; i <= n; i++) {
              par[i] = i;
              sz[i] = 1;
          }
      }
  
      int root(int x) {
          if (par[x] == x)
              return x;
          return par[x] = root(par[x]);
      }
  
      boolean find(int a, int b) {
          return root(a) == root(b);
      }
  
      int union(int a, int b) {
          int ra = root(a);
          int rb = root(b);
          if (ra == rb)
              return 0;
          if(a==b)
              return 0;
          if (sz[a] > sz[b]) {
              int temp = ra;
              ra = rb;
              rb = temp;
          }
          par[ra] = rb;
          sz[rb] += sz[ra];
          return 1;
      }
  }
  
  
  
  
  
  
  
  