#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl "\n"
int mod=1e9+7;
const int N=2e5+5;
template<class x>
using ordered_multiset = tree<x, null_type,less_equal<x>, rb_tree_tag,tree_order_statistics_node_update>;
int n,t;
map<pair<int,int>,bool> mp;
map<pair<int,int>,bool> vis;
map<pair<int,int>,int> plc;
vector<pair<int,int> > v;
vector<pair<int,int> > vv;
int dx[8]={0,0,1,-1,1,-1,-1,1};
int dy[8]={1,-1,0,0,1,-1,1,-1};
signed main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//freopen(".in", "r", stdin); freopen(".out", "w", stdout);
cin>>n>>t;
for (int i=0;i<n;i++) {
int x,y; cin>>x>>y;
mp[{x,y}]=true;
plc[{x,y}]=i+1;
v.push_back({x,y});
vv.push_back({y,x});
}
sort(v.begin(),v.end());
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > q;
int fx=v[0].first,fy=v[0].second;
int lx=v[n-1].first,ly=v[n-1].second;
for (auto i:v) {
if (q.size()>0) {break;}
if (i.first==fx && !vis[i]) {
q.push({i}); vis[i]=true;
}
if (i.second==fy && !vis[i]) {
q.push({i}); vis[i]=true;
}
if (i.first==lx && !vis[i]) {
q.push({i}); vis[i]=true;
}
if (i.second==ly && !vis[i]) {
q.push({i}); vis[i]=true;
}
}
vector<int> ans;
while (!q.empty()) {
int x=q.top().first,y=q.top().second;
q.pop();
ans.push_back(plc[{x,y}]);
for (int i=0;i<8;i++) {
int xx=x+dx[i],yy=y+dy[i];
if (!vis[{xx,yy}] && mp[{xx,yy}]) {
q.push({xx,yy}); vis[{xx,yy}]=true;
}
}
}
for (auto i:v) {
if (!vis[i]) {
cout<<"NO"; return 0;
}
}
cout<<"YES"<<endl;
for (int i:ans) cout<<i<<endl;
}
