#include <iostream>
using namespace std;
int main()
{
int n = 0;//renshu
int m = 0;//cishu
//int a[m][2];
cin >> n;
cin >> m;
int queues[n];
int i = 0;
for(i = 0; i < n; i++){
queues[i] = i+1;
}
int a[m][2];
for(i = 0; i < m; i++){
cin >> a[i][0] >> a[i][1];
}
for(i = 0; i < m; i++){
//cin >> a1 >> a2;
for(int k = 0; k < n; k++){
if(queues[k] == a[i][0]){
//int m = queues[k];
if(a[i][1] > 0){
for(int j = 0; j < a[i][1]; j++){
queues[k+j] = queues[k+j+1];
}
}
else if(a[i][1] < 0){
for(int j = 0; j < a[i][1]*(-1) ; j++){
queues[k-j] = queues[k-j-1];
}
}
queues[k + a[i][1]] = a[i][0];
break;
}
}
}
for(i = 0; i< n; i++){
cout << queues[i] << " ";
}
return 0;
}
using namespace std;
int main()
{
int n = 0;//renshu
int m = 0;//cishu
//int a[m][2];
cin >> n;
cin >> m;
int queues[n];
int i = 0;
for(i = 0; i < n; i++){
queues[i] = i+1;
}
int a[m][2];
for(i = 0; i < m; i++){
cin >> a[i][0] >> a[i][1];
}
for(i = 0; i < m; i++){
//cin >> a1 >> a2;
for(int k = 0; k < n; k++){
if(queues[k] == a[i][0]){
//int m = queues[k];
if(a[i][1] > 0){
for(int j = 0; j < a[i][1]; j++){
queues[k+j] = queues[k+j+1];
}
}
else if(a[i][1] < 0){
for(int j = 0; j < a[i][1]*(-1) ; j++){
queues[k-j] = queues[k-j-1];
}
}
queues[k + a[i][1]] = a[i][0];
break;
}
}
}
for(i = 0; i< n; i++){
cout << queues[i] << " ";
}
return 0;
}