State labels do not need to be like S0 and can in fact be anything you like. This can be quite useful for keeping track of the meaning of states if there are a lot of them. In some sense, in modern computers the state labels are given by the bit string which is the contents of the memory, and the operations that the computer does are operations on the state labels.
Construct a finite state automaton that recognises all strings over the alphabet \{a, b, c\} that have at least one a, at least one b, and at least one c. Give your answer as a state change diagram. Give your states meaningful labels.