#include <fstream>

using namespace std;
ifstream f ("sortaret.in");
ofstream g ("sortaret.out");
int p[50000],v[50000],i,j,x,y,n,m,aux,aux1,mn;
int main()
{   f>>n>>m;
    for(i=1;i<=n;i++)
    {
        f>>x>>y;
        v[y]=x;
    }
    for(i=1;i<=n;i++)p[i]=i;
    for(i=1;i<=n;i++)
        for(j=i+1;j<=n;j++)
        if(v[i]<v[j])
            {
                aux=v[i];v[i]=v[j];v[j]=aux;
                aux1=p[i];p[i]=p[j];p[j]=aux;
            }
    for(i=1;i<=n;i++){if(v[i]!=0)mn=v[i];}

    for(i=1;i<=n;i++)
    {
        if(v[i]==mn)g<<i<<" ";
        else mn=v[i],g<<i<<' ';
    }
    f.close();
    g.close();

    return 0;
}