#include <bits/stdc++.h>
using namespace std;
struct interval {
int l, r;
int i;
auto operator<=>(const interval &r) const = default;
};
const int inf = 1e9;
class segment_tree {
int n;
vector<int> seg;
public:
segment_tree(int n) : n(n), seg(2 * n, -inf) {}
void set(int i, int x) {
for (seg[i += n] = x, i >>= 1; i > 0; i >>= 1) {
seg[i] = max(seg[2 * i], seg[2 * i + 1]);
}
}
void apply(int i, int x) {
i += n;
for (seg[i] = max(seg[i], x), i >>= 1; i > 0; i >>= 1) {
seg[i] = max(seg[2 * i], seg[2 * i + 1]);
}
}
int query(int l, int r) {
int ans = -inf;
for (l += n, r += n + 1; l < r; l >>= 1, r >>= 1) {
if (l & 1)
ans = max(ans, seg[l++]);
if (r & 1)
ans = max(ans, seg[--r]);
}
return ans;
}
};
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<interval> a(n);
vector<int> buff;
for (int i = 0, l, r; i < n; ++i) {
cin >> l >> r;
a[i] = {l, r, i};
buff.push_back(l), buff.push_back(r);
}
sort(a.begin(), a.end());
sort(buff.begin(), buff.end());
buff.erase(unique(buff.begin(), buff.end()), buff.end());
auto comp = [&](int i) { return lower_bound(buff.begin(), buff.end(), i) - buff.begin(); };
vector<int> dp(n, 1);
segment_tree st(buff.size());
for (int i = n - 1; i >= 0; --i) {
dp[i] = max(dp[i], st.query(comp(a[i].r), buff.size() - 1) + 1);
st.apply(comp(a[i].l), dp[i]);
}
if (k > *max_element(dp.begin(), dp.end())) {
cout << "-1\n";
return 0;
}
vector<set<int>> mp(n + 1);
// st[steps] = index
segment_tree dp_st(n + 1);
auto refresh = [&](int x) {
dp_st.set(x, mp[x].empty() ? -inf : -*mp[x].begin());
};
for (int i = 0; i < n; ++i) {
mp[dp[i]].insert(i);
refresh(dp[i]);
}
int l = 0;
while (k) {
int i = -dp_st.query(k, n);
cout << i + 1 << '\n';
k--;
for (; l < n && a[l].l < a[i].r; ++l) {
mp[dp[l]].erase(l);
refresh(dp[l]);
}
}
}
