#include <bits/stdc++.h>
using namespace std;

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef complex<double> cpx;
template <typename T> using minPq = priority_queue<T, vector<T>, greater<T>>;
#define ms(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define fs first
#define sn second
#define ALL(v) begin(v), end(v)
#define SZ(v) ((int) (v).size())
#define lbv(v, x) (lower_bound(ALL(v), x) - (v).begin())
#define ubv(v, x) (upper_bound(ALL(v), x) - (v).begin())
template <typename T> inline void UNIQUE(vector<T> &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
#define FR(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define FORR(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) {cerr << #x << ' ' << x << endl;}
#define dbgArr(arr, n) {cerr << #arr; FR(_i, n) cerr << ' ' << (arr)[_i]; cerr << endl;}
template <typename T, typename U>
ostream& operator<<(ostream &os, pair<T, U> p){return os << "(" << p.fs << ", " << p.sn << ")";}

const int MN = 1e5 + 5;
int n, k;
pii arr[MN];
vi compr;

int mnR[MN];
int mxK[MN];

struct Tree {
    bitset<MN> ds;

    bool query(int l, int r){
        FOR(i, l, r) if(ds[i]) return true;
        return false;
    }

    void upd(int l, int r){
        FOR(i, l, r) ds[i] = true;
    }
};

Tree isecTree;

int main(){
    cin.sync_with_stdio(0); cin.tie(0);
    cin >> n >> k;
    FR(i, n){
        int l, r;
        cin >> l >> r;
        arr[i] = {l, r};
        compr.pb(l);
    }
    UNIQUE(compr);
    FR(i, n){
        auto &[l, r] = arr[i];
        l = lbv(compr, l);
        r = lbv(compr, r);
    }
    dbgArr(arr, n);

    fill(ALL(mnR), n);
    FORR(i, n-1, 0){
        auto [l, r] = arr[i];
        FR(j, l+1) mnR[j] = min(mnR[j], r);
        int p = 0, res = 0;
        while(p < n) p = mnR[p], res++;
        mxK[i] = res;
    }

    dbgArr(mxK, n);

    if(mxK[0] < k) return !printf("-1\n");

    FR(i, n){
        auto [l, r] = arr[i];
        if(!k) break;
        if(isecTree.query(l, r)) continue;
        if(mxK[i+1] < k-1) continue;
        cout << i+1 << '\n';
        k--;
        isecTree.upd(l, r);
    }
}