#include <bits/stdc++.h>
#define ll long long
using namespace std;

namespace vbzIO {
    char ibuf[(1 << 20) + 1], *iS, *iT;
    #if ONLINE_JUDGE
    #define gh() (iS == iT ? iT = (iS = ibuf) + fread(ibuf, 1, (1 << 20) + 1, stdin), (iS == iT ? EOF : *iS++) : *iS++)
    #else
    #define gh() getchar()
    #endif
    #define mt make_tuple
    #define mp make_pair
    #define fi first
    #define se second
    #define pc putchar
    #define pb emplace_back
    #define ins insert
    #define era erase
    typedef tuple<int, int, int> tu3;
    typedef pair<int, int> pi;
    inline int rd() {
        char ch = gh();
        int x = 0;
        bool t = 0;
        while (ch < '0' || ch > '9') t |= ch == '-', ch = gh();
        while (ch >= '0' && ch <= '9') x = (x << 1) + (x << 3) + (ch ^ 48), ch = gh();
        return t ? ~(x - 1) : x;
    }
    inline void wr(ll x) {
        if (x < 0) {
            x = ~(x - 1);
            putchar('-');
        }
        if (x > 9)
            wr(x / 10);
        putchar(x % 10 + '0');
    }
}
using namespace vbzIO;

int max(int i, int j) { return i > j ? i : j; }
ll min(ll i, ll j) { return i > j ? j : i; }

mt19937 rnd(time(0));
const int N = 2.5e5 + 250;
const int B = 510;
const int P = 998244353;
const ll inf = 2e18;
const int W = 800;
int n, m, b, x[N], y[N], id[N], rid[N], pos[N], lp[N], rp[N];
double t[N];
vector<pi> qr[N];
ll ans[N], mn[B], a[N];

void mdf(int p, ll q) {
	a[p] = min(a[p], q);
	mn[p] = min(mn[p], q);
}

ll qry(int p) {
	if (pos[p] == pos[n]) {
		ll res = inf;
		for (int i = p; i <= n; i++)
			res = min(res, a[i]);
		return res;
	}
	ll res = inf;
	for (int i = pos[p] + 1; i <= b; i++)
		res = min(res, mn[i]);
	for (int i = p; i <= rp[pos[p]]; i++)
		res = min(res, a[i]);
	return res;
} 

int main() {
	n = rd(), m = rd(), b = sqrt(n);
	for (int i = 1; i <= b; i++) 
		lp[i] = (i - 1) * b + 1, rp[i] = i * b;
	if (rp[b] < n) b++, lp[b] = rp[b - 1] + 1, rp[b] = n;
	for (int i = 1; i <= b; i++) {
		mn[i] = inf;
		for (int j = lp[i]; j <= rp[i]; j++)
			pos[j] = i;
	}
	for (int i = 1; i <= n; i++) x[i] = rd(), y[i] = rd(), id[i] = i, a[i] = inf;
	for (int i = 1, l, r; i <= m; i++) l = rd(), r = rd(), qr[r].pb(mp(l, i));
	double tp = 1. * (rnd() % P) / P * 2 * acos(-1), ta = cos(tp), tb = sin(tp);
	for (int i = 1; i <= n; i++) t[i] = x[i] * ta + y[i] * tb;
	sort(id + 1, id + n + 1, [](int &i, int &j) { return t[i] < t[j]; });
	for (int i = 1; i <= n; i++) rid[id[i]] = i;
	for (int r = 1; r <= n; r++) {
		for (int l = max(1, r - W); l < r; l++) 
			mdf(l, 1ll * (x[l] - x[r]) * (x[l] - x[r]) + 1ll * (y[l] - y[r]) * (y[l] - y[r]));
		for (int l = max(1, rid[r] - W); l <= min(rid[r] + W, n); l++) 
			if (id[l] < r) mdf(id[l], 1ll * (x[id[l]] - x[r]) * (x[id[l]] - x[r]) + 1ll * (y[id[l]] - y[r]) * (y[id[l]] - y[r]));
		for (pi p : qr[r]) ans[p.se] = qry(p.fi);
	}
	for (int i = 1; i <= m; i++)
		wr(ans[i]), puts("");
	return 0;
}