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.util.*;
  import java.io.*;
  public class Main{
      static Scanner sc=new Scanner(System.in);
      static PrintWriter pw=new PrintWriter(System.out);
      public static boolean check(int [][]arr,int mid) {
      	boolean [] can=new boolean[arr[0].length];
      	boolean pair=false;
      	for(int i=0;i<arr.length;i++) {
      		int c=0;
      		for(int j=0;j<arr[0].length;j++) {
      			if(arr[i][j]>=mid) {
      				c++;
      				can[j]=true;
      			}
      		}
      		if(c>1)pair=true;
      	}
      	if(!pair)return false;
      	boolean f=true;
      	for(boolean i:can)f&=i;
      	return f;
      }
      public static void main(String[] args) throws IOException, InterruptedException {
         int t=sc.nextInt();
         while(t-->0) {
              int n=sc.nextInt(),m=sc.nextInt();
              int [][]arr=new int[n][m];
              for(int i=0;i<n;i++)arr[i]=sc.nextIntArray(m);
              if(m-1>=n) {
                  int []ans=new int[m];
                  for(int i=0;i<m;i++) {
                  	int max=0;
                  	for(int j=0;j<n;j++) {
                  		max=Math.max(max, arr[j][i]);
                  	}
                  	ans[i]=max;
                  }
                  int min=(int)1e9+1;
                  for(int i:ans)min=Math.min(i, min);
                  pw.println(min);
              }
              else {
              	int start=0,end=(int)1e9;
              	while(start<=end) {
              		int mid=start+end>>1;
              	    if(check(arr,mid))
              	    	start=mid+1;
              	    else end=mid-1;
              	}
              	pw.println(end);
              }
         }
         pw.flush();
      }
      static class pair implements Comparable<pair> {
  //		int x;
  //		int y;
          long x,y;
  		public pair(long x, long y) {
  			this.x = x;
  			this.y = y;
  		}
  
  		public String toString() {
  			return x + " " + y;
  		}
  
  		public boolean equals(Object o) {
  			if (o instanceof pair) {
  				pair p = (pair) o;
  				return p.x == x && p.y == y;
  			}
  			return false;
  		}
  
  //		public int hashCode() {
  //			return new Integer(x).hashCode() * 31 + new Integer(y).hashCode();
  //		}
  
  		public int compareTo(pair other) {
  			if (this.x == other.x) {
  				return Long.compare(this.y, other.y);
  			}
  			return Long.compare(this.x, other.x);
  		}
  	}
      static class Scanner {
          StringTokenizer st;
          BufferedReader br;
          
   
          public Scanner(InputStream s) {
              br = new BufferedReader(new InputStreamReader(s));
          }
   
          public Scanner(FileReader r) {
              br = new BufferedReader(r);
          }
          public String readAllLines(BufferedReader reader) throws IOException {
              StringBuilder content = new StringBuilder();
              String line;
   
              while ((line = reader.readLine()) != null) {
                  content.append(line);
                  content.append(System.lineSeparator());
              }
   
              return content.toString();
          }
          public String next() throws IOException {
              while (st == null || !st.hasMoreTokens())
                  st = new StringTokenizer(br.readLine());
              return st.nextToken();
          }
   
          public int nextInt() throws IOException {
              return Integer.parseInt(next());
          }
   
          public long nextLong() throws IOException {
              return Long.parseLong(next());
          }
   
          public String nextLine() throws IOException {
              return br.readLine();
          }
   
          public double nextDouble() throws IOException {
              String x = next();
              StringBuilder sb = new StringBuilder("0");
              double res = 0, f = 1;
              boolean dec = false, neg = false;
              int start = 0;
              if (x.charAt(0) == '-') {
                  neg = true;
                  start++;
              }
              for (int i = start; i < x.length(); i++)
                  if (x.charAt(i) == '.') {
                      res = Long.parseLong(sb.toString());
                      sb = new StringBuilder("0");
                      dec = true;
                  } else {
                      sb.append(x.charAt(i));
                      if (dec)
                          f *= 10;
                  }
              res += Long.parseLong(sb.toString()) / f;
              return res * (neg ? -1 : 1);
          }
   
          public long[] nextlongArray(int n) throws IOException {
              long[] a = new long[n];
              for (int i = 0; i < n; i++)
                  a[i] = nextLong();
              return a;
          }
   
          public Long[] nextLongArray(int n) throws IOException {
              Long[] a = new Long[n];
              for (int i = 0; i < n; i++)
                  a[i] = nextLong();
              return a;
          }
   
          public int[] nextIntArray(int n) throws IOException {
              int[] a = new int[n];
              for (int i = 0; i < n; i++)
                  a[i] = nextInt();
              return a;
          }
   
          public Integer[] nextIntegerArray(int n) throws IOException {
              Integer[] a = new Integer[n];
              for (int i = 0; i < n; i++)
                  a[i] = nextInt();
              return a;
          }
   
          public boolean ready() throws IOException {
              return br.ready();
          }
   
      }
   
  }
  