Problem Statement

Maximize the Minimum Column Maximum Given an `n × m` matrix, select exactly `m − 1` distinct rows. For every column, take the maximum among selected rows. The score is the minimum of those `m` maxima. Print the largest achievable score. Input Format First line: `n m`. Next `n` lines: `m` integers each. Output Format Print the maximum possible score. Constraints `m − 1 ≤ n`, `2 ≤ m ≤ 7`, `1 ≤ n ≤ 100`, and entries fit in signed 32-bit integers. The bound on `m` is reconstructed to make the required subset search executable.