#include<iostream>
#include<vector>
#include<algorithm>
#pragma GCC optimize ("O3,unroll-loops,strict-overflow")
#pragma GCC target ("sse4,avx2,sse4.2,sse4.1")
#define MAXN 100001
using namespace std;
vector<int> pairs[MAXN];
int ans[MAXN],ind=0,ans1[MAXN],ind1=0,ind2=0,ans2[MAXN];
struct poinnts{
    long long x,y;
};
long long dist(poinnts a,poinnts b){
    return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
}
poinnts poinntss[MAXN];
bool g[MAXN];
pair<int,int> nodes[MAXN];
long long n,r,ints;
int main(){
   // srand(69);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    freopen("mars.in","r",stdin);
    freopen("mars.out","w",stdout);
    cin>>n>>r;
    for(long long i=0;i<n;i++){
        cin>>poinntss[i].x>>poinntss[i].y;
        nodes[i]={0,i};
    }
    for(int i=0;i<n;i++){
        nodes[i]={poinntss[i].y,i};
    }
    sort(nodes,nodes+n);
    for(long long i0=n-1;i0>=0;i0--){
        int i=nodes[i0].second;
        if(g[i]) continue;
        for(long long i1=0;i1<n;i1++){
            if(i1==i) continue;
            long long dst=dist(poinntss[i],poinntss[i1]);
            long long rr=r*r*4;
            if(dst<rr){
                g[i1]=true;
            }
        }
        ans[ind]=i;
        ind++;
    }
    for(int i=0;i<n;i++){
        g[i]=false;
    }
    for(long long i0=0;i0<n;i0++){
        int i=nodes[i0].second;
        if(g[i]) continue;
        for(long long i1=0;i1<n;i1++){
            if(i1==i) continue;
            long long dst=dist(poinntss[i],poinntss[i1]);
            long long rr=r*r*4;
            if(dst<rr){
                g[i1]=true;
            }
        }
        ans2[ind2]=i;
        ind2++;
    }
    if(ind2>ind){
        ind=ind2;
        for(int i=0;i<ind2;i++){
            ans[i]=ans2[i];
        }
    }
    if(n<5000){
        for(long long i=0;i<n;i++){
            nodes[i]={0,i};
            g[i]=false;
        }
        for(long long i=0;i<n;i++){
            for(long long i1=i+1;i1<n;i1++){
                long long dst=dist(poinntss[i],poinntss[i1]);
                long long rr=r*r*4;
                if(dst<rr){
                    pairs[i].push_back(i1);
                    pairs[i1].push_back(i);
                    nodes[i].first++;
                    nodes[i1].first++;
                }
            }
        }
        sort(nodes,nodes+n);
        for(long long i0=0;i0<n;i0++){
            int i=nodes[i0].second;
            if(g[i]) continue;
            for(long long i1=0;i1<pairs[i].size();i1++){
                g[pairs[i][i1]]=true;
            }
            ans1[ind1]=i;
            ind1++;
        }
    }
    if(ind>ind1){
        cout<<ind<<"\n";
        for(long long i=0;i<ind;i++){
            cout<<ans[i]+1<<" ";
        }
        cout<<"\n";
    }else{
        cout<<ind1<<"\n";
        for(long long i=0;i<ind1;i++){
            cout<<ans1[i]+1<<" ";
        }
        cout<<"\n";
    }
    return 0;
}