#include <iostream>
#include <vector>
#include <queue>


#define F first
#define S second


using namespace std;

queue <int> q;
int n,veg,i,maxi,m,fe;

int main()
{
    cin>>n>>m;
    vector <pair <int,int> > x(n+1);

    for(i=1;i<=n;++i)
    {
        cin>>x[i].F>>x[i].S;
    }

    veg=1;
    i=1;
    while(i<=n)
    {
        while(x[i].F<=veg)
        {
            if(maxi<x[i].S)
            {
                maxi=x[i].S;
                fe=i;
            }
            ++i;
        }
        veg=maxi;
        q.push(fe);
        if(veg==m)
        {
            cout<<q.size()-1<<"\n";
            while(!q.empty())
            {
                cout<<q.front()<<" ";
                q.pop();
            }
            return 0;
        }
    }
  //  cout<<-1;

}