Where is *?
Nic, after filing away all of his nicely sorted numbers has lost all his asterixis (asterixes?)... anyway
Given \(N\) lines of characters, one such character will be an asterisk, print out what column (zero-indexed) the asterisk appears on.
The first line will contain a single integer \(N\), the number of lines to process.
The next \(N\) lines will consist of up to
m characters. Each line is comprised of dashes
- and a single asterix.
Output \(N\) lines, on each printing the column in which the asterisk appeared in the corresponding input line.
The first sub-problem consists of the sample data
The second sub-problem has the following bounds:
- \(1 \leq N \leq 100\)
- \(1 \leq M \leq 100\)
The final sub-problem has the following bounds:
- \(1 \leq N \leq 1000\)
- \(1 \leq M \leq 1000\)
Sample Input 1
3 ---*--- --*--- *----
Sample Output 1
3 2 0