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.*;
  import java.lang.*;
  
  // Problem - Multiples of 3 onn codeforces MNedium difficulty level 
  // or check on youtube channel CodeNCode
  
  public class Problem {
       static int Mod = 1000000007;
      static long dp[][];
      static int g[][];
      static int fact[];
  
  
      public static void main(String[] args) {
          MyScanner scan = new MyScanner();
          PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
           int t = scan.nextInt();
          // int t = 1;
          while (t-- > 0) {
               int m= scan.nextInt();
               int n= scan.nextInt();
               int a[][]= new int[m][n];
               for(int i=0;i<m;i++){
                   for(int j=0;j<n;j++){
                       a[i][j]= scan.nextInt();
                   }
               }
                
               int start=1;
               int end=1000000000;
  
               int ans=-1;
  
               while(start<=end){
                   int mid= start+ (end-start)/2;
  
                   int flag=0;
                   int flag1=0;
                   Set<Integer> set= new HashSet<>();
                    for(int i=0;i<n;i++){
                      int x=0;
                       for(int j=0;j<m;j++){
                           if(a[j][i]>=mid) {
                               x=1;
                               if(set.contains(j)){
                                   flag1=1;
                               }
                               set.add(j);
                               continue;
                           }   
                           
                       }
                       if(x==0){
                           flag=1;
                           break;
                       }
                   }
  
                   if(flag!=1 && flag1==1){
                      start= mid+1;
                      ans= mid;
                   }else{
                      end= mid-1;
                   }
                   
               }
  
               out.println(ans);
          }
  
          out.close();
      }
  
   
  
  
  
      static ArrayList<Integer> digits(long n){
          ArrayList<Integer> list= new ArrayList<>();
          while(n>0){
              list.add((int)(n%10l));
              n=n/10l;
          }
          Collections.reverse(list);
          return list;
      }
  
      static class Pair {
          int l;
          int r;
  
          Pair(int l, int r) {
              this.l = l;
              this.r = r;
          }
  
          @Override
          public int hashCode() {
              final int prime = 31;
              int result = 1;
              result = prime * result + l;
              result = prime * result + r;
              return result;
          }
  
          @Override
          public boolean equals(Object obj) {
              if (this == obj)
                  return true;
              if (obj == null)
                  return false;
              if (getClass() != obj.getClass())
                  return false;
              Pair other = (Pair) obj;
              if (l != other.l)
                  return false;
              if (r != other.r)
                  return false;
              return true;
          }
  
          @Override
          public String toString() {
              return "Pair [l=" + l + ", r=" + r + "]";
          }
  
      }
  
      public static void reverse(int a[]) {
          int n = a.length;
          for (int i = 0; i < n / 2; i++) {
              int temp = a[i];
              a[i] = a[n - i - 1];
              a[n - i - 1] = temp;
          }
      }
  
      public static void sort(int[] array) {
          ArrayList<Integer> copy = new ArrayList<>();
          for (Integer i : array)
              copy.add(i);
          Collections.sort(copy);
          for (int i = 0; i < array.length; i++)
              array[i] = copy.get(i);
      }
  
      public static void sort(long[] array) {
          ArrayList<Long> copy = new ArrayList<>();
          for (Long i : array)
              copy.add(i);
          Collections.sort(copy);
          for (int i = 0; i < array.length; i++)
              array[i] = copy.get(i);
      }
  
      public static long gcd(long a, long b) {
          if (b == 0)
              return a;
          return gcd(b, a % b); // gcd(a,b) = gcd(a-b,b) or gcd(a,b) = gcd(b,a%b) where a>b
      }
  
      public static int gcd(int a, int b) {
          if (b == 0)
              return a;
          return gcd(b, a % b); // gcd(a,b) = gcd(a-b,b) or gcd(a,b) = gcd(b,a%b) where a>b
      }
  
      public static long lcm(long a, long b) {
          return (a / gcd(a, b)) * b;
      }
  
      static long power(long x, long y) {
          long temp;
          if (y == 0) // a^b= (a^b/2)^2 if b is even
              return 1; // = (a*a^(b-1)) if b is odd
          temp = power(x, y / 2);
          if (y % 2 == 0)
              return temp * temp;
          else
              return x * temp * temp;
      }
  
      static long mod(long x) {
          return ((x % Mod + Mod) % Mod);
      }
  
      static long add(long a, long b) {
          return mod(mod(a) + mod(b));
      }
  
      static int mod(int x) {
          return ((x % Mod + Mod) % Mod);
      }
  
      static int add(int a, int b) {
          return mod(mod(a) + mod(b));
      }
  
      static int sub(int a, int b) {
          return mod(mod(a) - mod(b) + Mod);
      }
  
      static long mul(long a, long b) {
          return mod(mod(a) * mod(b));
      }
  
      static long pow(long x, long y, long p) {
          long res = 1; // Initialize result
          x = x % p; // Update x if it is more than or equal to p
  
          if (x == 0)
              return 0; // In case x is divisible by p;
  
          while (y > 0) {
              // If y is odd, multiply x with result
              if ((y & 1) != 0)
                  res = (res * x) % p;
  
              // y must be even now
              y = y >> 1; // y = y/2
              x = (x * x) % p;
          }
          return res;
      }
  
      static long modInverse(long a, long m) {
          // int g = gcd(a, m);
          // if (g != 1)
          // System.out.println("Inverse doesn't exist");
          // else {
          // // If a and m are relatively prime, then modulo
          // // inverse is a^(m-2) mode m
          // return power(a, m - 2, m);
          // }
          return pow(a, m - 2, m);
      }
  
  }
  
  class MyScanner {
      BufferedReader br;
      StringTokenizer st;
  
      public MyScanner() {
          br = new BufferedReader(new InputStreamReader(System.in));
      }
  
      String next() {
          while (st == null || !st.hasMoreElements()) {
              try {
                  st = new StringTokenizer(br.readLine());
              } catch (IOException e) {
                  e.printStackTrace();
              }
          }
          return st.nextToken();
      }
  
      int nextInt() {
          return Integer.parseInt(next());
      }
  
      long nextLong() {
          return Long.parseLong(next());
      }
  
      double nextDouble() {
          return Double.parseDouble(next());
      }
  
      String nextLine() {
          String str = "";
          try {
              str = br.readLine();
          } catch (IOException e) {
              e.printStackTrace();
          }
          return str;
      }
  
  }
  