I think this is a permutations problem. I'm not sure how to go about it.

Problem:

In how many different ways could you select three different days of the week, such that at least one of them begins with the letter "T"? Assume that the order is important.

Is it something like: (7)(6)(5) = 210? Is that the answer? 210 ways?

Thank you for un-confusing me!