#include <iostream>

using namespace std;

int main(){
	int n, w;
    long long tmp, result;
    cin>>n>>w;
    long long x[n];
    int y[n];
    long long closest[n];
	
    for(int i = 0; i < n; i++)	cin>>x[i]>>y[i];
    
    result = 0;
    for(int i = 0; i < n; i++){
		if(!closest[i])	closest[i] = w*1000000000*w*1000000000;
        for(int j = i+1; j < n; j++){
            tmp = (x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]);
            if(tmp < closest[i])	closest[i] = tmp;
            if(tmp < closest[j])	closest[j] = tmp;
        }
        if(closest[i] > result)	result = closest[i];
    }
    cout<<result;
}