$3m$ balls numbered $1, 1, 1, 2, 2, 2, 3, 3, 3, \ldots, m, m, m$ are distributed into $8$ boxes so that any two boxes contain identical balls. Find the minimal possible value of $m$.
Problem
Source: Turkey JBMO TST 2014 P2
Tags: ceiling function, combinatorics proposed, combinatorics