Step 1: Find the HCF using Euclid's division algorithm instead of prime factorisation.
\[ 99 = 66 \times 1 + 33 \]
\[ 66 = 33 \times 2 + 0 \]
Since the remainder is now 0, the HCF is the last non-zero remainder.
Step 2: Identify the HCF.
\[ \text{HCF}(66, 99) = 33 \]
Step 3: Solve for m.
\[ 55m - 132 = 33 \implies 55m = 165 \implies m = 3 \]
\[ \boxed{m = 3} \]