#include<cstdio>
using namespace std;
const int N = 1000 + 10;
int a[N], b[N];//a[N]记录学号的位置
int main()
{
int n, m, p, q;
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i ++)
{
a[i] = b[i] = i;
}
while(m --)
{
scanf("%d%d", &p, &q);
int k = a[p];
if(q > 0){
for(int i = k; i < k + q; i ++)
{
b[i] = b[i + 1];
a[b[i]] --;
}
}else{
for(int i = k; i > k + q; i --)
{
b[i] = b[i - 1];
a[b[i]] ++;
}
}
b[k + q] = p;
a[p] = k + q;
}
for(int i = 1; i < n; i ++) printf("%d ", b[i]);
printf("%d\n", b[n]);
return 0;
}
------------------------------------更新----------------------------------------
/*
之前写的程序,程序的思想是东拼西凑得出来的,看起来晦涩难懂,但其实自己想明白以后,重新写程序的时候,思路就非常清晰了~
(σ゚∀゚)σ..:*☆哎哟不错哦
*/
#include <iostream>
using namespace std;
const int N = 1005;
int a[N];
int find(int a[], int p, int n) //找到学号为p的学生在数组中 的下标
{
for(int i = 0; i < n; i ++)
{
if(a[i] == p) return i;
}
}
int main()
{
int n, m, p, q, temp, pos;
cin >> n >> m;
for(int i = 0; i < n; i ++) //初始化
{
a[i] = i + 1;
}
while(m --)
{
cin >> p >> q;
pos = find(a, p, n);
temp = a[pos];
if(q > 0){
for(int i = pos; i < pos + 1 + q; i ++)
{
a[i] = a[i + 1];
}
}else{
for(int i = pos - 1; i >= pos + q; i --)
{
a[i + 1] = a[i];
}
}
a[pos+q] = temp;
}
for(int i = 0; i < n; i ++)
{
cout << a[i];
if(i != n-1) cout << " ";
}
return 0;
}