PROGRAMMING:Array element movement
Complete the function of moving array elements: assuming that there are n elements in the array, enter a number x, save the element at the x position of the array first, then move the elements from x + 1 to n forward one bit in turn, and finally put the original element at the x position at the end of the array.
Repeat the movement several times to get the final result.
###Input format:
The first line contains an integer n (1 < = n < = 100), which represents the number of array elements.
In the second line, enter n array elements, all of which are integers separated by spaces.
In the third line, enter a number k (1 < = k < = 100), which means to move K times.
Next, there are k rows, each with a number x, indicating that the x-th element is to be moved.
###Output format:
Output after K times of moving the array, every two elements separated by spaces.
###Input example:
```in
ten
1 2 3 4 5 6 7 8 9 10
four
four
three
two
five
```
###Output example:
```out
1 5 6 7 9 10 4 3 2 8
```
answer：If there is no answer, please comment
Repeat the movement several times to get the final result.
###Input format:
The first line contains an integer n (1 < = n < = 100), which represents the number of array elements.
In the second line, enter n array elements, all of which are integers separated by spaces.
In the third line, enter a number k (1 < = k < = 100), which means to move K times.
Next, there are k rows, each with a number x, indicating that the x-th element is to be moved.
###Output format:
Output after K times of moving the array, every two elements separated by spaces.
###Input example:
```in
ten
1 2 3 4 5 6 7 8 9 10
four
four
three
two
five
```
###Output example:
```out
1 5 6 7 9 10 4 3 2 8
```
answer：If there is no answer, please comment