Given a string s of length n, the task is to count the number of occurrences of each prefix of the string in the entire string. For a prefix defined as s[0...i] (where i ranges from 0 to n-1), determine how many times this prefix appears as a substring within s.