CAPGEMINI 1 PM SLOTS ARE AVAILABLE

def canPurchaseWithMinPrice(P, N, M, min_price):  
    counts = []  
    for shop in P:  
        counts.append(sum(1 for price in shop if price >= min_price))  
    
    counts.sort(reverse=True)  
    
    total_items = 0  
    for i in range(N - 1):  
        total_items += counts[i]  
        if total_items >= M:  
            return True  
            
    return total_items >= M  

def maxMinPrice(N, M, P):  
    low, high = 1, 100000  
    answer = 0  
    
    while low <= high:  
        mid = (low + high) // 2  
        
        if canPurchaseWithMinPrice(P, N, M, mid):  
            answer = mid  
            low = mid + 1  
        else:  
            high = mid - 1  
            
    return answer  

N = int(input())  
M = int(input())  
P = [list(map(int, input().split())) for _ in range(N)]  

result = maxMinPrice(N, M, P)  
print(result)