#include <iostream>
#include <vector>

using  namespace std;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	vector<int>a(n+1);
	vector<int>b(n+1);
	for (int i = 1; i <= n; ++i)
	{
		cin >> a[i] >> b[i];
	}
	vector<int>optimal;
	int jarat;
	int idev = 0;
	for (jarat = 1; a[jarat] < 2; ++jarat);
	--jarat;
	optimal.push_back(jarat);
	while (idev < m)
	{
		int maxv=b[jarat];
		int maxin=-1;
		int vege = b[jarat];
		int j = jarat;
		for (int j=jarat; a[j] <= vege and j < n; ++j)
		{
			idev = b[j];
			if (idev > maxv)
			{
				maxv = idev;
				maxin = j;
			}
		}
		optimal.push_back(maxin);
		if (maxin == -1)
		{
			cout << -1;
			return 0;
		}
		jarat = maxin;
	}
	cout << optimal.size() - 1 << endl;
	for (int i = 0; i < optimal.size(); i++) cout << optimal[i] << " ";
	return 0;
}