PROGRAMMING:Hash mapping of integer keywords
Given a series of integer keywords and prime number $$p $, the hash function $$H (key) = key% p $, defined by the method of remainder division, maps the keywords to the hash table of length $$p $. The linear detection method is used to solve the conflict.
###Input format:
The first line of input first gives two positive integers $$n $$($$Le 1000 $$) and $$p $$($$Ge n $$) which are the total number of keywords to be inserted and the length of hash table. The second line gives $$n $$integer keywords. Numbers are separated by spaces.
###Output format:
Output the position of each integer keyword in the hash table in one row. Numbers are separated by spaces, but there must be no extra spaces at the end of the line.
###Input example:
```in
4 5
24 15 61 88
```
###Output example:
```out
4 0 1 3
```
answer：If there is no answer, please comment
###Input format:
The first line of input first gives two positive integers $$n $$($$Le 1000 $$) and $$p $$($$Ge n $$) which are the total number of keywords to be inserted and the length of hash table. The second line gives $$n $$integer keywords. Numbers are separated by spaces.
###Output format:
Output the position of each integer keyword in the hash table in one row. Numbers are separated by spaces, but there must be no extra spaces at the end of the line.
###Input example:
```in
4 5
24 15 61 88
```
###Output example:
```out
4 0 1 3
```
answer：If there is no answer, please comment