How many ways are there to create two 3-digit numbers $m$ and $n$ such that $n = 3m$? Each of the digits $1$, $2$, $3$, $6$, $7$, and $8$ must be used exactly once.

Let's think step by step and output the final answer within \boxed{}.
user