#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

vector<pair<vector<int>, int> > person;
int n, m;

void read() {
    vector<int> V;
    scanf("%d%d", &n, &m);
    for(int i = 0; i < n; ++i) {
        int a;
        scanf("%d", &a);
        V.push_back(a);
    }
    person.push_back(make_pair(V, 0));

    for(int i = 1; i < m; ++i) {
        int p, x;
        scanf("%d%d", &p, &x);
        V[p - 1] = x;
        person.push_back(make_pair(V, i));
    }

    sort(person.begin(), person.end());
}

void write() {
    for(int i = 0; i < m; ++i) {
        printf("%d ", person[i].second + 1);
    }
}

int main()
{
    read();
    write();

    return 0;
}