We obtain a lower bound for $$\#\{x/2<p_n\leq x \colon\, \, p_n\equiv\dots\equiv p_{n+m}\equiv a\pmod{q}$$ , $$p_{n+m} - p_n\leq y\}$$ where $$p_n$$ is the $$n$$ th prime.