You are creating passwords of length \(8\) using only the letters \(A\), \(B\), and \(C\). Each password must use all three letters at least once.
How many such passwords are there?
How many numbers from \(1\) to \(1000\) are divisible by \(2\) or \(3\)?