1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
| #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main() {
int n, m, d;
cin >> n >> m >> d;
vector<int> a(m);
rep(i, m) cin >> a[i];
vector<int> v(n);
rep(i, n) v[i] = i;
rep(i, m) {
swap(v[a[i]-1], v[a[i]]);
}
map<int, int> res;
rep(i, n) {
res[v[i]] = i;
}
vector<int> next(n), cur(n);
rep(i, n) cur[i] = i;
while(d) {
if(d & 1) {
rep(i, n) next[i] = res[cur[i]];
rep(i, n) cur[i] = next[i];
}
rep(i, n) next[i] = res[res[i]];
rep(i, n) res[i] = next[i];
d /= 2;
}
rep(i, n) {
cout << cur[i] + 1 << endl;
}
return 0;
}
|