There are a total of 8 possible numbers for each digit and there are 3 digits for the password. Since the problem didn't state that the numbers can't be repeated, then we can apply the following formula:
[tex]C_{n,m}\text{ = }\frac{n!}{m!(n\text{ - m)!}}[/tex]Where "n" is the range of possibilities for each number and "m" is the number of digits we want to arrange them. So applying the data from the problem gives us:
[tex]undefined[/tex]