Question 16
Consider a table with $m$ rows and 22 columns. Each cell is filled with a number from the set $A = \{1, 2, 3, \dots, 2025\}$ (numbers may be repeated), such that for every pair of distinct numbers in $A$, there exists a row that contains exactly one of these two numbers. Find the minimum value of $m$.