#include <iostream>
#include <algorithm>

using namespace std;

struct VonatInfo {
    int sorszam;
    int start;
    int stop;
};

bool kisebbVonat(VonatInfo v1, VonatInfo v2) {
    return v1.start < v2.start;
}

int main() {

    VonatInfo A[10000];
    int hasznaltVonat[10000];
    int N, M;
    cin >> N >> M;

    for (int i = 0; i < N; i++) {
        int start, stop;
        cin >> start >> stop;
        A[i].sorszam = i + 1;
        A[i].start = start;
        A[i].stop = stop;
    }

    sort(A, A+N, kisebbVonat);

    int hol = 1, maxAllomas = 1;
    int K = 0;
    int i = 0;
    int maxHasznaltVonat;

    bool eljut = true;

    while (eljut && hol < M) {
        maxAllomas = hol;
        while (i<N and A[i].start <= hol) {
            if (A[i].stop >= maxAllomas) {
                maxAllomas = A[i].stop;
                maxHasznaltVonat = A[i].sorszam;
            }
            i++;
        }
        if (hol != maxAllomas) {
            hol = maxAllomas;
            hasznaltVonat[K++] = maxHasznaltVonat;
        }
        else {
            eljut = false;
        }
    }

    if (eljut) {
        cout << K-1 << endl;

        sort(hasznaltVonat, hasznaltVonat+K);
        for (int i = 0; i < K; i++) cout << hasznaltVonat[i] << " ";
    }
    else {
        cout << "-1";
    }

    return 0;
}