#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
int dptable[100000];
vector<ii> events;
int dp(int i) {
if (i == events.size()) return 0;
if (dptable[i] != -1) return dptable[i];
return dptable[i] = max(dp(i + 1), dp(lower_bound(events.begin(), events.end(), ii(events[i].second, 0)) - events.begin()) + 1);
}
int main() {
int N, K; cin >> N >> K;
int L[N], R[N];
for (int i = 0; i < N; ++i) cin >> L[i] >> R[i];
if (N <= 3000) {
vector<int> ans;
bool can_use[N];
fill_n(can_use, N, true);
for (int i = 0; i < N; ++i) {
if (!can_use[i]) continue;
events.clear();
events.push_back(ii(L[i], R[i]));
for (int j = i + 1; j < N; ++j)
if (can_use[j] && (R[i] <= L[j] || R[j] <= L[i]))
events.push_back(ii(L[j], R[j]));
sort(events.begin(), events.end());
fill_n(dptable, events.size(), -1);
if (dp(0) + ans.size() >= K) {
ans.push_back(i + 1);
for (int j = i + 1; j < N; ++j)
if (L[j] < R[i] && L[i] < R[j])
can_use[j] = false;
}
}
if (ans.size() >= K)
for (int i = 0; i < K; ++i)
printf("%d\n", ans[i]);
else printf("-1");
} else {
for (int i = 0; i < N; ++i) events.push_back(ii(L[i], R[i]));
fill_n(dptable, events.size(), -1);
if (dp(0) >= K) {
int cur = 0, ptr = 0;
while (cur < K) {
while (cur + dp(lower_bound(events.begin(), events.end(), ii(events[ptr].second, 0)) - events.begin()) + 1 < K) ++ptr;
printf("%d\n", ptr + 1);
ptr = lower_bound(events.begin(), events.end(), ii(events[ptr].second, 0)) - events.begin(), ++cur;
}
} else printf("-1");
}
}
