#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr Int INF = 1001001001001001001LL;
void bChmin(vector<Int> &bit, int pos, Int val) {
  const int bitN = bit.size();
  for (int x = pos; x < bitN; x |= x + 1) chmin(bit[x], val);
}
Int bMin(const vector<Int> &bit, int pos) {
  Int ret = INF;
  for (int x = pos; x > 0; x &= x - 1) chmin(ret, bit[x - 1]);
  return ret;
}


int N, Q;
vector<Int> A, B;
vector<int> L, R;

Int dist(int u, int v) {
  return abs(A[u] - A[v]) + abs(B[u] - B[v]);
}

/*
pair<int, int> closest(int l, int r) {
  Int mn = INF;
  int um = -1, vm = -1;
  for (int u = l; u < r; ++u) for (int v = u + 1; v < r; ++v) {
    if (chmin(mn, dist(u, v))) {
      um = u;
      vm = v;
    }
  }
  return make_pair(um, vm);
}
*/
pair<int, int> closest(int l, int r) {
  vector<pair<Int, int>> aus(r - l);
  for (int u = l; u < r; ++u) aus[u - l] = make_pair(A[u], u);
  sort(aus.begin(), aus.end());
  Int mn = INF;
  int um = -1, vm = -1;
  for (int i = 0; i < r - l; ++i) {
    const int u = aus[i].second;
    for (int j = i; --j >= 0; ) {
      const int v = aus[j].second;
      if (mn <= A[u] - A[v]) break;
      if (chmin(mn, dist(u, v))) {
        um = u;
        vm = v;
      }
    }
  }
  return make_pair(um, vm);
}

vector<vector<int>> vss;
void rec(int l, int r) {
  if (r - l >= 2) {
    const auto res = closest(l, r);
    int u = res.first, v = res.second;
    if (u > v) swap(u, v);
    vss[u].push_back(v);
    rec(l, v);
    rec(u + 1, r);
  }
}

int main() {
  for (; ~scanf("%d%d", &N, &Q); ) {
    A.resize(N);
    B.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%lld%lld", &A[u], &B[u]);
    }
    L.resize(Q);
    R.resize(Q);
    for (int q = 0; q < Q; ++q) {
      scanf("%d%d", &L[q], &R[q]);
      --L[q];
    }
    
    vss.assign(N, {});
    rec(0, N);
    
    vector<vector<int>> qss(N);
    for (int q = 0; q < Q; ++q) qss[L[q]].push_back(q);
    vector<Int> ans(Q, INF);
    vector<Int> bit(N, INF);
    for (int u = N; --u >= 0; ) {
      for (const int v : vss[u]) {
        bChmin(bit, v, dist(u, v));
      }
      for (const int q : qss[u]) {
        ans[q] = bMin(bit, R[q]);
      }
    }
    
    for (int q = 0; q < Q; ++q) {
      printf("%lld\n", ans[q]);
    }
  }
  return 0;
}