Erdős problem 1190

Let $$\epsilon_m=\max \sum \frac{1}{n_i}$$ where the maximum is taken over all finite sequences $m<n_1<\cdots<n_k$ for which there exist congruences $a_i\pmod{n_i}$ such that no integer satisfies two such congruences.