#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<pi>> vvpi;
typedef vector<ld> vd;
typedef vector<long long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1e6+3;
void init(string name)
{
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
void fastIO()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
}
vi tryx = {0,0,1,-1,-1,1,-1,1};
vi tryy = {1,-1,0,0,-1,-1,1,1};
void solve()
{
int n,t;cin >> n >> t;
map<pi,int> mp;
set<pair<pi,int>> arr;
FOR(i,0,n){
int a,b;cin >> a >> b;
if(i==0)arr.insert({{a,b},-1});
else mp[{a,b}] = i+1;
}
vi ans;
while(!arr.empty()){
auto edge = *arr.begin();
arr.erase(arr.begin());
ans.pb(-edge.S);
pi pos = edge.F;
FOR(i,0,8){
int x = pos.F + tryx[i], y = pos.S + tryy[i];
if(mp.count({x,y})){
arr.insert({{x,y},-mp[{x,y}]});
mp.erase({x,y});
}
}
}
if(ans.size() != n){cout << "NO\n";return;}
cout << "YES\n";
for(int a:ans)cout << a << "\n";
}
int main()
{
fastIO();
// init("test");
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}
