#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<typename T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<typename T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<typename T>void operator+=(vc<T>&a,T b){for(T&x:a)x+=b;}
template<typename T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(y<x){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
// #define ret(x) { cout<<(x)<<endl; return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;
#define bn(x) ((1ll<<(x))-1)
const int di[] = {-1,0,1,0,-1,-1,1,1,0}, dj[] = {0,-1,0,1,-1,1,-1,1,0}; //^<v>

// - cannot use count
// - no move constructor (==> cannot use merge tech)
// - unordered_set by value: __gnu_pbds::null_type
// - no erase(iterator)
#include <ext/pb_ds/assoc_container.hpp>
using __gnu_pbds::gp_hash_table;
#define HT gp_hash_table
//https://codeforces.com/blog/entry/62393
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    // http://xorshift.di.unimi.it/splitmix64.c
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }

  size_t operator()(uint64_t x) const {
    // static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
    static const uint64_t FIXED_RANDOM = 0;
    return splitmix64(x + FIXED_RANDOM);
  }
  
  size_t operator()(pair<int,int> x)const{
    return operator()(uint64_t(x.first)<<32|x.second);
  }
};

// Binary Indexed Tree
struct bit {
  int n; vector<ll> d;
  bit() {}
  bit(int mx): n(mx+1), d(mx+1,LINF) {}
  void add(int i, ll x) {
    for (++i;i<n;i+=i&-i) mins(d[i],x);
  }
  ll get(int i) {
    ll x = LINF;
    for (++i;i;i-=i&-i) mins(x,d[i]);
    return x;
  }
};
//

ll pow2(ll x) { return x*x;}
ll dist(const P& a, const P& b) {
  return pow2(a.fi-b.fi)+pow2(a.se-b.se);
}

struct arr {
  array<int,6> a; int n;
  arr(): n(0) {}
  void push_back(int x) { a[n++] = x;}
  void erase(int x) {
    rep(i,n) if (a[i] == x) a[i] = a[--n];
  }
};

struct Solver {
  const int D = 27;
  struct Grid {
    int w, r;
    HT<ll,arr,custom_hash> g;
    const vp& ps; vl& md;
    Grid(int w, int n, const vp& ps, vl& md): w(w), r(n), ps(ps), md(md) {}
    ll tol(const P& p) { return (ll)(p.fi>>w)<<30|(p.se>>w);}
    ll tol(int i, int j) { return (ll)i<<30|j;}
    void add(int i, vi& js) {
      const P& p = ps[i];
      int gi = p.fi>>w, gj = p.se>>w;
      rep(v,9) {
        int ni = gi+di[v], nj = gj+dj[v];
        if (ni < 0 || nj < 0) continue;
        auto it = g.find(tol(ni,nj));
        if (it == g.end()) continue;
        const arr& a = it->se;
        rep(ai,a.n) {
          int j = a.a[ai];
          if (mins(md[j], dist(p,ps[j]))) js.pb(j);
        }
      }
      g[tol(gi,gj)].pb(i);
    }
    void del(int l) {
      while (l < r) {
        --r;
        g.find(tol(ps[r]))->se.erase(r);
      }
    }
  };

  void solve() {
    int n, q;
    cin>>n>>q;
    vp ps(n);
    cin>>ps;

    vvp qs(n);
    rep(qi,q) {
      int l, r;
      cin>>l>>r;
      qs[l-1].eb(r,qi);
    }

    bit d(n);
    vl md(n,LINF);
    vc<Grid> gs;
    rep(i,D) gs.eb(i,n,ps,md);

    vi rd(n,D-1);
    vl ans(q);
    drep(i,n) {
      vi js;
      rep(di,D) gs[di].add(i,js);
      uni(js);
      for (int j : js) {
        while (rd[j] >= 0) {
          if (md[j]*4 > (1ll<<(rd[j]<<1))) break;
          gs[rd[j]--].del(j);
        }
        d.add(j,md[j]);
      }
      for (auto [r,qi] : qs[i]) ans[qi] = d.get(r-1);
    }
    rep(i,q) printf("%lld\n",ans[i]);
  }
};

int main() {
  // cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  // scanf("%d",&ts);
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}