#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n;++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
const int Mod = 998244353;
const int inv2 = (Mod+1) / 2;
inline int sign(int a){ return (a&1) ? (Mod-1) : 1; }
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, int p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 100;
int fact[fN], invfact[fN], pw2[fN], invpw2[fN];
void initfact(int n){
	pw2[0] = 1; for(int i = 1; i <= n; ++i) pw2[i] = mul(pw2[i-1], 2);
	invpw2[0] = 1; for(int i = 1; i <= n; ++i) invpw2[i] = mul(invpw2[i-1], (Mod+1) / 2);
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
}
int binom(int n, int m){ return mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
inline void chmax(int &a, int b){ (b>a) ? (a=b) : 0; }

int n, k;
int l[100100], r[100100];
int ord[100100], ind[100100];
set<int> st;

int nxt[20][100100];
void precalc(){
	vector<pii> tmp; rep(i, n) tmp.emplace_back(l[i], i+1), tmp.emplace_back(r[i], -i-1);
	sort(tmp.begin(), tmp.end());
	int cur = n; l[n] = r[n] = inf, nxt[0][n] = n;
	for(int i = 2*n-1; i >= 0; --i){
		int id = abs(tmp[i].second) - 1;
		if(tmp[i].second > 0){ if(r[id] < r[cur]) cur = id; }
		else nxt[0][i] = cur;
	}
	l[n+1] = r[n+1] = -1, nxt[0][n+1] = cur;
	rep(i, 18) rep(j, n+2) nxt[i+1][j] = nxt[i][nxt[i][j]];
}

inline bool inter(int a, int b){ return max(l[a], l[b]) < min(r[a], r[b]); }
int calc(int lb, int ub){
	int ret = 0;
	for(int u = lb, i = 18; i >= 0; --i) if(r[nxt[i][u]] <= l[ub]) u = nxt[i][u], ret += (1<<i);
	return ret; 
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> k; rep(i, n) cin >> l[i] >> r[i];

	precalc();

	rep(i, n+2) ord[i] = i;
	sort(ord, ord+n+2, [&](int lh, int rh){ return l[lh] < l[rh]; });
	rep(i, n+2) ind[ord[i]] = i;

	st.emplace(0), st.emplace(n+1);
	int curans = calc(ord[0], ord[n+1]);
	vi ans;
	rep(i, n){
		auto ur = st.lower_bound(ind[i]), ul = prev(ur);
		int pl = ord[*ul], pr = ord[*ur];
		if(inter(i, pr) || inter(i, pl)) continue;
		int tmp = curans - calc(pl, pr) + calc(pl, i) + calc(i, pr) + 1;
		if(tmp >= k){ curans = tmp, st.emplace(ind[i]), ans.emplace_back(i); if((int)ans.size() >= k) break; }
	}

	if((int)ans.size() < k){ cout << "-1\n"; return 0; }
	rep(i, (int)ans.size()) cout << ans[i] + 1 << "\n";

	return 0;
}