#include <bits/stdc++.h>
using namespace std;
const int N = 150'000 + 10,
dx[8] = {-1, -1, 0, 1, 1, -1, 0, 1},
dy[8] = {-1, 0, -1, -1, 0, 1, 1, 1};
int n, type;
struct Point {
int r, c, idx;
bool operator > (const auto& rhs) {
return make_pair(r, c) > make_pair(rhs.r, rhs.c);
}
friend ostream& operator << (ostream& os, const auto& rhs) {
return os << rhs.r << " " << rhs.c << " " << rhs.idx;
}
} p[N];
unordered_map<int, unordered_map<int, int>> rvs;
bool mk[N];
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> type;
for (int i = 1; i <= n; ++i) {
int r, c; cin >> r >> c;
p[i] = {r, c, i};
rvs[r][c] = i;
}
Point st = p[1];
for (int i = 1; i <= n; ++i) if (st > p[i]) st = p[i];
queue<Point> q;
q.push(st);
mk[st.idx] = true;
vector<int> answer;
while (q.size()) {
auto [r, c, idx] = q.front(); q.pop();
answer.push_back(idx);
for (int i = 0; i < 8; ++i) {
int nR = r + dx[i], nC = c + dy[i],
nxt = rvs[nR][nC];
if (!nxt || mk[nxt]) continue;
mk[nxt] = true;
q.push(p[nxt]);
}
}
if (answer.size() != n) { cout << "No\n"; return 0; };
cout << "YES\n";
for (const auto& x : answer) cout << x << "\n";
}
