Given the set of symbols $\{P, Q, R\}$, how many distinct formulas can be formed using exactly two binary connectives and two variables (allowing repetition)?