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
59
60
61
62
63
#include<cstdio>
#include<algorithm>

int n, m;
int ** X;

void input() {
  scanf("%d %d", &n, &m);
  X = new int*[m];
  for (int i = 0; i < m; i++) {
    X[i] = new int[n];
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", X[0] + i);
  }
}

void copyFromPrevious(int i) {
  for (int j = 0; j < n; j++) {
    X[i][j] = X[i-1][j];
  }
}

void generate() {
  for (int i = 1; i < m; i++) {
    int p,x;
    scanf("%d %d", &p, &x);
    copyFromPrevious(i);
    X[i][p - 1] = x;
  }
}

void brute_generate() {
  input();
  generate();
}

bool cmp(int i, int j) {
  for (int k = 0; k < n; k++) {
    if (X[i][k] < X[j][k]) {
      return true;
    }
  }
  return i < j;
}

void solve() {
  int * idx = new int[m];
  for (int i = 0; i < m; i++) {
    idx[i] = i;
  }
  std::sort(idx, idx + m, cmp);
  for (int i = 0; i < m; i++) {
    printf("%d ", idx[i] + 1);
  }
  printf("\n");
}

int main(int argc, char ** argv) {
  brute_generate();
  solve();
  return 0;
}