There exists a constant $C$ such that for all large $x$ there is a collection of primes $p_1<\dots <p_k<x$ with $\sum \frac{1}{p_i}<C$ together with a system of congruences $a_i(\mathrm{mod}{p}_i)$ such that every integer $n<x$ satisfies at least one of these congruences.