Answer: 1/970200
Step-by-step explanation:
This is a permutation problem, because the order matters.
There are 100! ways for the 100 customers to visit the store.
There are (100−3)!=97! ways for the three friends to be the first, ninth, and ninetieth customers