#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")


// T: monoid representing information of an interval.
//   T()  should return the identity.
//   T(S s)  should represent a single element of the array.
//   T::pull(const T &l, const T &r)  should pull two intervals.
template <class T> struct SegmentTreePoint {
  int logN, n;
  vector<T> ts;
  SegmentTreePoint() : logN(0), n(0) {}
  explicit SegmentTreePoint(int n_) {
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
  }
  template <class S> explicit SegmentTreePoint(const vector<S> &ss) {
    const int n_ = ss.size();
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
    for (int i = 0; i < n_; ++i) at(i) = T(ss[i]);
    build();
  }
  T &at(int i) {
    return ts[n + i];
  }
  void build() {
    for (int u = n; --u; ) pull(u);
  }

  inline void pull(int u) {
    ts[u].pull(ts[u << 1], ts[u << 1 | 1]);
  }

  // Changes the value of point a to s.
  template <class S> void change(int a, const S &s) {
    assert(0 <= a); assert(a < n);
    ts[a += n] = T(s);
    for (; a >>= 1; ) pull(a);
  }

  // Applies T::f(args...) to point a.
  template <class F, class... Args>
  void ch(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a < n);
    (ts[a += n].*f)(args...);
    for (; a >>= 1; ) pull(a);
  }

  // Calculates the product for [a, b).
  T get(int a, int b) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return T();
    T prodL, prodR, t;
    for (a += n, b += n; a < b; a >>= 1, b >>= 1) {
      if (a & 1) { t.pull(prodL, ts[a++]); prodL = t; }
      if (b & 1) { t.pull(ts[--b], prodR); prodR = t; }
    }
    t.pull(prodL, prodR);
    return t;
  }

  // Calculates T::f(args...) of a monoid type for [a, b).
  //   op(-, -)  should calculate the product.
  //   e()  should return the identity.
  template <class Op, class E, class F, class... Args>
#if __cplusplus >= 201402L
  auto
#else
  decltype((std::declval<T>().*F())())
#endif
  get(int a, int b, Op op, E e, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return e();
    auto prodL = e(), prodR = e();
    for (a += n, b += n; a < b; a >>= 1, b >>= 1) {
      if (a & 1) prodL = op(prodL, (ts[a++].*f)(args...));
      if (b & 1) prodR = op((ts[--b].*f)(args...), prodR);
    }
    return op(prodL, prodR);
  }

  // Find min b s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from left to right.
  //   Returns n + 1 if there is no such b.
  template <class F, class... Args>
  int findRight(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a <= n);
    if ((T().*f)(args...)) return a;
    if (a == n) return n + 1;
    a += n;
    for (; ; a >>= 1) if (a & 1) {
      if ((ts[a].*f)(args...)) {
        for (; a < n; ) {
          if (!(ts[a <<= 1].*f)(args...)) ++a;
        }
        return a - n + 1;
      }
      ++a;
      if (!(a & (a - 1))) return n + 1;
    }
  }

  // Find max a s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from right to left.
  //   Returns -1 if there is no such a.
  template <class F, class... Args>
  int findLeft(int b, F f, Args &&... args) {
    assert(0 <= b); assert(b <= n);
    if ((T().*f)(args...)) return b;
    if (b == 0) return -1;
    b += n;
    for (; ; b >>= 1) if ((b & 1) || b == 2) {
      if ((ts[b - 1].*f)(args...)) {
        for (; b <= n; ) {
          if (!(ts[(b <<= 1) - 1].*f)(args...)) --b;
        }
        return b - n - 1;
      }
      --b;
      if (!(b & (b - 1))) return -1;
    }
  }
};  // SegmentTreePoint<T>

////////////////////////////////////////////////////////////////////////////////


struct NodeMin {
  static constexpr int INF = 1001001001;
  int mn;
  NodeMin() : mn(+INF) {}
  NodeMin(int val) : mn(val) {}
  void pull(const NodeMin &l, const NodeMin &r) {
    mn = min(l.mn, r.mn);
  }
  void ch(int val) {
    mn = val;
  }
  void chmin(int val) {
    if (mn > val) mn = val;
  }
  bool test(int tar) const {
    return (mn <= tar);
  }
};


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


int readInt() {
  int c;
  for (; ; ) {
    c = getchar();
    if ('0' <= c && c <= '9') break;
    if (c == -1) throw -1;
    if (c == '-') return -readInt();
  }
  int x = c - '0';
  for (; ; ) {
    c = getchar();
    if (!('0' <= c && c <= '9')) return x;
    x = x * 10 + (c - '0');
  }
}
char writeIntBuffer[10];
void writeUInt(unsigned x) {
  int i = 0;
  do {
    writeIntBuffer[i++] = '0' + (x % 10);
    x /= 10;
  } while (x != 0);
  for (; i > 0; ) {
    putchar(writeIntBuffer[--i]);
  }
}


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

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

vector<vector<int>> vss;

void sub1d() {
  vector<pair<int, int>> aus(N);
  for (int u = 0; u < N; ++u) aus[u] = make_pair(A[u], u);
  sort(aus.begin(), aus.end());
  vector<int> poss(N, -1);
  for (int j = 0; j < N; ++j) poss[aus[j].second] = j;
  vector<int> lef(N);
  for (int j = 0; j < N; ++j) lef[j] = (j && aus[j - 1].first == aus[j].first) ? lef[j - 1] : j;
  SegmentTreePoint<NodeMin> seg(N);
  for (int u = N; --u >= 0; ) {
    const int pos = poss[u];
    for (int v = N; ; ) {
      int l = seg.findLeft(pos, &NodeMin::test, v - 1);
      int r = seg.findRight(pos + 1, &NodeMin::test, v - 1);
      if (l >= 0) l = upper_bound(aus.begin() + lef[l], aus.begin() + l, make_pair(aus[l].first, u)) - aus.begin();
      --r;
      if (l < 0 && N <= r) break;
      if (l >= 0 && (N <= r || make_pair(A[u] - aus[l].first, aus[l].second) <= make_pair(aus[r].first - A[u], aus[r].second))) {
        v = aus[l].second;
      } else {
        v = aus[r].second;
      }
      vss[u].push_back(v);
    }
    seg.change(pos, u);
  }
}

int main() {
  for (; ~scanf("%d%d", &N, &Q); ) {
    A.resize(N);
    B.resize(N);
    for (int u = 0; u < N; ++u) {
      // scanf("%d%d", &A[u], &B[u]);
      A[u] = readInt();
      B[u] = readInt();
    }
    L.resize(Q);
    R.resize(Q);
    for (int q = 0; q < Q; ++q) {
      // scanf("%d%d", &L[q], &R[q]);
      L[q] = readInt();
      R[q] = readInt();
      --L[q];
    }
    
    vss.assign(N, {});
    if (B == vector<int>(N, 0)) {
      sub1d();
    } else {
      for (int u = 0; u < N; ++u) {
        unsigned mn = ~0U;
        for (int v = u + 1; v < N; ++v) {
          if (chmin(mn, dist(u, v))) {
            vss[u].push_back(v);
          }
        }
      }
    }
    
    vector<vector<int>> qss(N);
    for (int q = 0; q < Q; ++q) qss[L[q]].push_back(q);
    vector<unsigned> ans(Q, ~0U);
    vector<unsigned> bit(N, ~0U);
    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) {
      writeUInt(ans[q]);
      putchar('\n');
    }
  }
  return 0;
}