// ===== 2018/11/24 20:59:12 =====

// ../../../lib/template/includes.hpp

#include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <vector>

// ../../../lib/template/cin.cpp

template <typename T, int M, int N> struct tuple_getter {
  static void get(std::istream &is, T &x) {
    is >> std::get<M>(x);
    tuple_getter<T, M + 1, N>::get(is, x);
  }
};

template <typename T, int N> struct tuple_getter<T, N, N> {
  static void get(std::istream &is, T &x) { is >> std::get<N>(x); }
};

template <typename... Args>
std::istream &operator>>(std::istream &is, std::tuple<Args...> &t) {
  tuple_getter<std::tuple<Args...>, 0, sizeof...(Args) - 1>::get(is, t);
  return is;
}

template <typename T, typename U>
std::istream &operator>>(std::istream &is, std::pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
  for (T &x : v) is >> x;
  return is;
}

// ../../../lib/template/const_value.hpp

namespace sub {
template <typename T>
constexpr typename std::enable_if<std::is_integral<T>::value, T>::type
inf_sub() {
  return std::numeric_limits<T>::max() / 2 - 1000;
}

template <typename T>
constexpr typename std::enable_if<std::is_floating_point<T>::value, T>::type
inf_sub() {
  return std::min(std::numeric_limits<T>::max() / 2 - 1000, T(1e50));
}
}  // namespace sub

template <typename T> constexpr T inf() {
  static_assert(std::is_arithmetic<T>::value, "T must be arithmetic value");
  return sub::inf_sub<T>();
}

template <typename T> constexpr T zero() {
  static_assert(std::is_arithmetic<T>::value, "T must be arithmetic value");
  return T(0);
}

const long double pi = acos(-1.0);

// ../../../lib/template/cout.cpp

template <typename T, int M, int N> struct tuple_printer {
  static void print(std::ostream &os, const T &x) {
    os << std::get<M>(x) << " ";
    tuple_printer<T, M + 1, N>::print(os, x);
  }
};

template <typename T, int N> struct tuple_printer<T, N, N> {
  static void print(std::ostream &os, const T &x) { os << std::get<N>(x); }
};

template <typename... Args>
std::ostream &operator<<(std::ostream &os, const std::tuple<Args...> &t) {
  tuple_printer<std::tuple<Args...>, 0, sizeof...(Args) - 1>::print(os, t);
  return os;
}

template <typename T, typename U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << " ";
    os << *it;
  }
  return os;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::set<T> &v) {
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << " ";
    os << *it;
  }
  return os;
}

// ../../../lib/template/initialize.cpp

struct yes_no : std::numpunct<char> {
  string_type do_truename() const { return "Yes"; }
  string_type do_falsename() const { return "No"; }
};

struct Initialize {
  Initialize() {
    std::locale loc(std::locale(), new yes_no);
    std::cout << std::boolalpha << std::setprecision(11) << std::fixed;
    std::cout.imbue(loc);
  }
};

const Initialize initialize;

// ../../../lib/template/macros.hpp

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()

// ../../../lib/template/misc.hpp

template <typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }

template <typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }

// ../../../lib/template/range.hpp

class range {
  class index_type {
    int x;

  public:
    index_type(int x_) : x(x_) {}
    int operator*() const { return x; }
    bool operator!=(index_type &r) { return x < r.x; }
    void operator++() { ++x; }
  };
  index_type i, n;

public:
  range(int n_) : i(0), n(n_) {}
  range(int i_, int n_) : i(i_), n(n_) {}
  index_type &begin() { return i; }
  index_type &end() { return n; }
};

// ../../../lib/template/typedef.hpp

using ll = long long;
using ld = long double;

// ../../../lib/template/template.cpp

using namespace std;

// D.cpp

template<typename T>
vector<T> table(int n, T v) { return vector<T>(n, v); }

template <class... Args>
auto table(int n, Args... args) {
  auto val = table(args...);
  return vector<decltype(val)>(n, move(val));
}

int cnt[1024][1024];
int cnt1[2048][2048];
int cnt2[2048][2048];

void solve(ll N, ll D, vector<ll> x, vector<ll> y) {
  REP(i,N) {
    int X = x[i] % D;
    int Y = y[i] % D;
    cnt[X][Y]++;
  }
  int max_count = 0;
  REP(i,D) REP(j,D) {
    chmax(max_count, cnt[i][j]);
  }
  int Base = 0;
  while (Base * Base < max_count) ++Base;
  REP(i,D) REP(j,D) {
    if (cnt[i][j] > Base * (Base - 1)) cnt2[i+1][j+1] = 1;
    if (cnt[i][j] > (Base - 1) * (Base - 1)) cnt1[i+1][j+1] = 1;
  }
  REP(i,D+1) REP(j,D+1) {
    if (i == 0 || j == 0) continue;
    cnt1[i+D][j] = cnt1[i][j];
    cnt1[i][j+D] = cnt1[i][j];
    cnt1[i+D][j+D] = cnt1[i][j];
    cnt2[i+D][j] = cnt2[i][j];
    cnt2[i][j+D] = cnt2[i][j];
    cnt2[i+D][j+D] = cnt2[i][j];
  }
  REP(i,D+D+1) REP(j,D+D+1) cnt1[i+1][j] += cnt1[i][j];
  REP(i,D+D+1) REP(j,D+D+1) cnt1[i][j+1] += cnt1[i][j];
  REP(i,D+D+1) REP(j,D+D+1) cnt2[i+1][j] += cnt2[i][j];
  REP(i,D+D+1) REP(j,D+D+1) cnt2[i][j+1] += cnt2[i][j];

  int max_width = 0;
  REP(y,D) REP(x,D) {
    int lb = 0, ub = D;
    while (ub - lb > 1) {
      int w = (lb + ub) / 2;
      int u = y + D - w;
      int b = y + D;
      int l = x + D - w;
      int r = x + D;
      if (cnt1[b][r] - cnt1[b][l] - cnt1[u][r] + cnt1[u][l] == 0 &&
          cnt2[b][r] - cnt2[b][l] - cnt2[y][r] + cnt2[y][l] == 0 &&
          cnt2[b][r] - cnt2[b][x] - cnt2[u][r] + cnt2[u][x] == 0) lb = w;
      else ub = w;
    }
    chmax(max_width, lb);
  }
  cout << Base * D - max_width - 1 << endl;
}

int main() {
	ll N;
	ll D;
	scanf("%lld", &N);
	vector<ll> x(N-1+1);
	vector<ll> y(N-1+1);
	scanf("%lld", &D);
	for (int i = 0 ; i <= N-1 ; i++) {
	  scanf("%lld", &x[i]);
	  scanf("%lld", &y[i]);
	}
	solve(N, D, x, y);
	return 0;
}
// ===== 2018/11/24 20:59:12 =====



Measured memory_bytes: 40192