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
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,a,b) for(int i=a;i>b;i--)
#define repLL(i,a,b) for(LL i=(LL)a;i<(LL)b;i++)
#define perLL(i,a,b) for(LL i=(LL)a;i>(LL)b;i--)
#define debug5(a,b,c,d,e) cerr<<#a<<": "<<a<<" "<<#b<<": "<<b<<" "<<#c<<": "<<c<<" "<<#d<<": "<<d<<" "<<#e<<": "<<e<<endl;
#define debug4(a,b,c,d)  cerr<<#a<<": "<<a<<" "<<#b<<": "<<b<<" "<<#c<<": "<<c<<" "<<#d<<": "<<d<<endl;
#define debug3(a,b,c) cerr<<#a<<": "<<a<<" "<<#b<<": "<<b<<" "<<#c<<": "<<c<<endl;
#define debug2(a,b) cerr<<#a<<": "<<a<<" "<<#b<<": "<<b<<endl;
#define debug(a) cerr<<#a<<": "<<a<<endl;
#define pb push_back
#define mp make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) x.begin(),x.end()
#define fi first
#define se second
#define _upgrade ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

typedef long long LL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef vector<LL> VLL;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<char> VC;
typedef long double LD;
typedef pair<LD,LD> PLD;
typedef vector<LD> VLD;
typedef vector<PLD> VPLD;

const int maxn=(1<<19)+7;
const int inf=(1e9)+7;
const LL LLinf=(1e18)+7;
const LD eps=1e-9;
const LL mod[2]={(int)1e9+7,(int)1e9+696969};

// ***************************** CODE ***************************** //

unordered_map<LL,int> mapa;
int numer;
int tab[maxn];
int pot=1<<19;
int POT[maxn][2];
int t[maxn];

struct node
{
      node * left, *right;
      int val[2];

      node(int v,int v2,node * l = 0 , node * p = 0)
      {
            val[0]=v%mod[0];
            val[1]=v2%mod[1];
            left=l;
            right=p;
      }
};

node * root[maxn];

int x , val;

node * dodaj(node * curr,int lewo,int prawo)
{
      if(lewo==prawo)
      {
            node * a = new node(val,val);
            return a;
      }
      int sr=(lewo+prawo)/2;
      node * a = new node(val,val,curr->left,curr->right);
      if(x<=sr)
            a->left=dodaj(curr->left,lewo,sr);
      else
            a->right=dodaj(curr->right,sr+1,prawo);
      rep(i,0,2)
            a->val[i]=(a->left->val[i]+POT[prawo-lewo][i]*(LL)a->right->val[i])%mod[i];
      return a;
}

void tworz(node * curr,int lewo,int prawo)
{
      if(lewo==prawo)
      {
            rep(i,0,2)
                  curr->val[i] = tab[lewo];
            return ;
      }
      int sr=(lewo+prawo)/2;
      curr->left= new node(0,0);
      tworz(curr->left,lewo,sr);
      curr->right= new node(0,0);
      tworz(curr->right,sr+1,prawo);
      rep(i,0,2)
            curr->val[i]=(curr->left->val[i]+POT[prawo-lewo][i]*(LL)curr->right->val[i])%mod[i];
}

node * lewo, * prawo;

bool sor(int a,int b)
{
      if(root[a]->val[0]==root[b]->val[0] && root[a]->val[1]== root[b]->val[1])
            return a<b;
      lewo = root[a];
      prawo = root[b];
      int A=pot;
      while(A>1)
      {
            if(lewo->left->val[0]==prawo->left->val[0] && lewo->left->val[1]==prawo->left->val[1])
            {
                  lewo=lewo->right;
                  prawo=prawo->right;
            }
            else
            {
                  lewo=lewo->left;
                  prawo=prawo->left;
            }
            A/=2;
      }
      return lewo->val[0]<prawo->val[0];
}

int main()
{
      _upgrade
      int n,m;
      cin>>n>>m;
      POT[0][1]=POT[0][0]=1LL;
      rep(i,1,maxn)
            POT[i][0]=(POT[i-1][0]*(LL)3671LL)%mod[0];
      rep(i,1,maxn)
            POT[i][1]=(POT[i-1][1]*(LL)14461LL)%mod[1];
      // int n=5e5;
      // int m=5e5;
      rep(i,1,n+1)
      {
            // tab[i]=rand();
            cin>>tab[i];
      }
      root[1] = new node(0,0);
      tworz(root[1],1,pot);
      rep(i,2,m+1)
      {
            // int p,val;
            cin>>x>>val;
            // x=rand()%n+1;
            // val=rand();

            root[i]=dodaj(root[i-1],1,pot);
            // cout<<root[i]->val[0]<<" "<<root[i]->val[1]<<endl;
      }
      rep(i,1,m+1)
            t[i]=i;
      sort(t+1,t+1+m,sor);
      rep(i,1,m+1)
            cout<<t[i]<<" ";
      return 0;
}