Character Frequency in Order of Occurrence

For the given string S of length N, determine the frequency of each character from 'a' to 'z' appearing within S.

Input:

The first input line contains an integer 'T' representing the number of test cases. Each subsequent line for each test case contains the string 'S'.

Output:

For each test case, output a single line with 26 space-separated integers, each indicating the frequency of the corresponding character from 'a' to 'z'.

Example:

Input:
S = "abcdg"
Output:
1 1 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

Constraints:

• 1 <= T <= 10^2
• 1 <= |S| <= 10^4
• All characters in the string are lowercase English alphabets.
• Time Limit: 1 second

Note:

No need to handle I/O, only function implementation is required.