#include<iostream>
using namespace std;
int a[2000];
int main()
{
int n,m,p,q,i,j,position;
cin>>n>>m;
for(i=1;i<=n;i++)
a[i]=i;
for(i=1;i<=m;i++)
{
cin>>p>>q;
for(j=1;j<=n;j++)
if(p==a[j])
{
position=j;
break;
}
if(position+q>n)
{
for(j=position-1;j>=1;j--)
a[j+1]=a[j];
a[1]=p;
continue;
}
if(position+q<0)
{
for(j=position;j>n;j++)
a[j]=a[j+1];
a[n]=p;
continue;
}
if(q>0)
{
for(j=position;j<position+q;j++)
a[j]=a[j+1];
a[position+q]=p;
continue;
}
if(q<0)
{
for(j=position;j>position+q;j--)
a[j]=a[j-1];
a[position+q]=p;
continue;
}
}
for(i=1;i<=n-1;i++)
cout<<a[i]<<" ";
cout<<a[n];
}
using namespace std;
int a[2000];
int main()
{
int n,m,p,q,i,j,position;
cin>>n>>m;
for(i=1;i<=n;i++)
a[i]=i;
for(i=1;i<=m;i++)
{
cin>>p>>q;
for(j=1;j<=n;j++)
if(p==a[j])
{
position=j;
break;
}
if(position+q>n)
{
for(j=position-1;j>=1;j--)
a[j+1]=a[j];
a[1]=p;
continue;
}
if(position+q<0)
{
for(j=position;j>n;j++)
a[j]=a[j+1];
a[n]=p;
continue;
}
if(q>0)
{
for(j=position;j<position+q;j++)
a[j]=a[j+1];
a[position+q]=p;
continue;
}
if(q<0)
{
for(j=position;j>position+q;j--)
a[j]=a[j-1];
a[position+q]=p;
continue;
}
}
for(i=1;i<=n-1;i++)
cout<<a[i]<<" ";
cout<<a[n];
}