![]() |
||||||||||
|
||||||||||
Shuffle CardTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3767 Accepted Submission(s): 1665 Problem Description A deck of card consists of $n$ cards. Each card is different, numbered from 1 to n. At first, the cards were ordered from 1 to $n$. We complete the shuffle process in the following way, In each operation, we will draw a card and put it in the position of the first card, and repeat this operation for $m$ times. Please output the order of cards after $m$ operations. Input The first line of input contains two positive integers $n$ and $m$.(1<=$n,m$<=$10^5$) The second line of the input file has n Numbers, a sequence of 1 through $n$. Next there are m rows, each of which has a positive integer $s_i$, representing the card number extracted by the $i$-th operation. Output Please output the order of cards after m operations. (There should be one space after each number.) Sample Input
Sample Output
Source | ||||||||||
|