TH-TMO 2018 Problem 7

We color each number in the set $S = \{1, 2, ..., 61\}$ with one of $25$ given colors, where it is not necessary that every color gets used. Let $m$ be the number of non-empty subsets of $S$ such that every number in the subset has the same color. What is the minimum possible value of $m$ ?