#include <iostream>
#include <map>
#include <queue>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)
int N, T, X[1 << 18], Y[1 << 18];
map<pair<int, int>, int> Map;
vector<int> G[1 << 18];
bool used[1 << 18];
void solve_subtask1() {
for (int i = 1; i <= N; i++) Map[make_pair(X[i], Y[i])] = i;
for (int i = 1; i <= N; i++) {
int dx[8] = { 1, 1, 1, 0, -1, -1, -1, 0 };
int dy[8] = { -1, 0, 1, 1, 1, 0, -1, -1 };
for (int j = 0; j < 8; j++) {
int ex = X[i] + dx[j], ey = Y[i] + dy[j];
if (Map[make_pair(ex, ey)] >= 1) {
G[i].push_back(Map[make_pair(ex, ey)]);
}
}
}
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> Q;
Q.push(make_pair(X[1], Y[1])); vector<int> I;
while (!Q.empty()) {
pair<int, int> pos = Q.top(); Q.pop();
int idx = Map[pos]; if (used[idx] == true) continue;
used[idx] = true; I.push_back(idx);
for (int i : G[idx]) {
if (used[i] == true) continue;
Q.push(make_pair(X[i], Y[i]));
}
}
if ((int)I.size() != N) {
printf("NO\n");
}
else {
printf("YES\n");
for (int i = 0; i < I.size(); i++) printf("%d\n", I[i]);
}
}
void solve_subtask2() {
}
int main() {
scanf("%d%d", &N, &T);
for (int i = 1; i <= N; i++) scanf("%d%d", &X[i], &Y[i]);
if (T == 1) {
solve_subtask1();
}
else {
solve_subtask2();
}
return 0;
}
