For each letter from $a$ to $z$, count its occurrences in string $S$.
### Input
- String $S$ on one line.
### Output
- 26 integers, the number of occurrences of $a$ to $z$ respectively.
### Constraints
- $1 \le |S| \le 10^5$.
### Example
Input:
```
abcda!
```
Output:
```
2 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
```
