In this paper we construct pairwise balanced designs (PBDs) having block sizes which are prime powers congruent to modulo together with . Such a PBD contains points, for some positive integer . We show that this condition is sufficient for , with at most possible exceptions below this value. As an application, we prove that there exists an almost resolvable BIB design with points and block size five whenever , with at most possible exceptions below this value.