PROGRAMMING:On the right shift of array elements
There are $$n $$($$> 0 $$) integers in an array $$a $. On the premise that no other array is allowed, move each integer cycle to the right by $$M $$($$Ge 0 $$) positions, that is, the data in $$a $$is generated by ($$a)_ 0 A_ 1 \cdots A_{ N-1} $$) to ($$a)_{ N-M} \cdots A_{ N-1} A_ 0 A_ 1 \cdots A_{ N-m-1} $$(the last number of $$M $$is cycled to the first position of $$M $$). If you need to consider the program to move data as few times as possible, how to design the method of moving?
###Input format:
Each input contains a test case. In the first line, enter $$n $$($$1 / Le n / Le 100 $$) and $$M $$($$Ge 0 $$); On line 2, enter $$n $$integers separated by spaces.
###Output format:
In one line, output a sequence of integers after the $$M $$bit is shifted to the right, separated by spaces, and there should be no extra spaces at the end of the sequence.
###Input example:
```in
6 2
1 2 3 4 5 6
```
###Output example:
```out
5 6 1 2 3 4
```
answer：If there is no answer, please comment
###Input format:
Each input contains a test case. In the first line, enter $$n $$($$1 / Le n / Le 100 $$) and $$M $$($$Ge 0 $$); On line 2, enter $$n $$integers separated by spaces.
###Output format:
In one line, output a sequence of integers after the $$M $$bit is shifted to the right, separated by spaces, and there should be no extra spaces at the end of the sequence.
###Input example:
```in
6 2
1 2 3 4 5 6
```
###Output example:
```out
5 6 1 2 3 4
```
answer：If there is no answer, please comment