Let S be the set of 3-digit decimal integers {000, 001, 002, . . . , 999}. Use Inclusion-Exclusion to find how many such integers contain at least one 7. (Hint. Let S1 be the subset of S consisting of elements with first digit equal to 7, etc.)

I have no idea how to use the inclusion-exclusion principle so can anyone help with that please?