#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define mt make_tuple
#define mp make_pair
#define pb push_back
#define int long long
#define f first
#define s second
#define pll pair<long long, long long>
#define iii tuple<int,int,int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
vector<pll> dir={{0, 1}, {1, 1}, {1, 0}, {1, -1}, {0, -1}, {-1, -1}, {-1, 0}, {-1, 1}};
signed main(){
int n,t;cin>>n>>t;
vector<pll> v(n);
set<pll> ex;
map<pll,int> toind, ch;
pll mn={1e15, 1e15};
for(int i=0;i<n;i++){
cin>>v[i].f>>v[i].s;
toind[v[i]]=i+1;
ex.insert(v[i]);
mn=min(mn, v[i]);
}
vector<pll> ord;
auto dfs=[&](auto && dfs, pll c)->void{
ex.erase(c);
auto [x, y] = c;
for(auto [dx, dy] : dir){
int nx=x+dx, ny=y+dy;
if(ex.find(mp(nx, ny)) != ex.end()){
ch[c]++;
dfs(dfs, mp(nx, ny));
}
}
};
dfs(dfs, mn);
for(auto it : v) ex.insert(it);
auto dfs2=[&](auto && dfs2, pll c)->void{
ex.erase(c);
auto [x, y] = c;
if(ch[c] >= 2)ord.pb(c);
for(auto [dx, dy] : dir){
int nx=x+dx, ny=y+dy;
if(ex.find(mp(nx, ny)) != ex.end()){
dfs2(dfs2, mp(nx, ny));
}
}
if(ch[c] < 2) ord.pb(c);
};
dfs2(dfs2, mn);
if(sz(ord) != n){
cout<<"NO\n";
return 0;
}
cout<<"YES\n";
for(auto it : ord)cout<<toind[it]<<'\n';
}
