#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
int inf=1000000007;
ll infl=1000000000000000007;
int mod=998244353;

const int N=200007,L=18;

int l[N],r[N];
map<int,int>M;

int skok[2*N][L];

int cnt(int l,int r)
{
    int ans=0;
    for(int j=L-1;j>=0;j--)
    {
        if(skok[l][j]<=r)
        {
            ans+=(1<<j);
            l=skok[l][j];
        }
    }
    return ans;
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,k;
    cin>>n>>k;
    set<int>S;
    for(int i=1;i<=n;i++)
    {
        cin>>l[i]>>r[i];
        S.insert(l[i]);
        S.insert(r[i]);
    }
    int it=0;
    for(auto x:S) M[x]=++it;
    for(int i=1;i<=it+1;i++) skok[i][0]=it+1;
    for(int i=1;i<=n;i++)
    {
        l[i]=M[l[i]];
        r[i]=M[r[i]];
        skok[l[i]][0]=min(skok[l[i]][0],r[i]);
    }
    for(int i=it;i>0;i--) skok[i][0]=min(skok[i][0],skok[i+1][0]);
    for(int j=1;j<L;j++) for(int i=1;i<=it+1;i++) skok[i][j]=skok[skok[i][j-1]][j-1];
    int ile=cnt(1,it);
    if(ile<k)
    {
        cout<<-1;
        return 0;
    }
    set<pair<int,int>>X;
    X.insert({-inf,-inf});
    X.insert({1,it});
    int c=0;
    for(int i=1;i<=n&&c<k;i++)
    {
        pair<int,int>p=*--X.upper_bound({l[i],inf});
       // cout<<p.st<<" "<<p.nd<<" "<<l[i]<<" "<<r[i]<<endl;
        if(p.nd<r[i]) continue;
        int nile=ile-cnt(p.st,p.nd)+1+cnt(p.st,l[i])+cnt(r[i],p.nd);
        if(nile>=k)
        {
            cout<<i<<endl;
            c++;
            ile=nile;
            X.erase(p);
            X.insert({p.st,l[i]});
            X.insert({r[i],p.nd});
        }
    }


    return 0;
}