#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>

#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { lhs = rhs; return true; }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { lhs = rhs; return true; }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp"

class range {
public:
  class iterator {
  private:
    int64_t M_position;

  public:
    constexpr iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { ++M_position; }
    constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }
  };

  class reverse_iterator {
  private:
    int64_t M_position;
  
  public:
    constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { --M_position; }
    constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }
  };
  
private:
  const iterator M_first, M_last;

public:
  constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
  constexpr iterator begin() const noexcept { return M_first; }
  constexpr iterator end() const noexcept { return M_last; }
  constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } 
  constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } 
};

/**
 * @title Range
 */
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/rev.cpp"

#include <type_traits>
#include <iterator>
#line 6 "/Users/kodamankod/Desktop/cpp_programming/Library/other/rev.cpp"

template <class T>
class rev_impl {
public:
  using iterator = decltype(std::rbegin(std::declval<T>()));

private:
  const iterator M_begin;
  const iterator M_end;

public:
  constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { }
  constexpr iterator begin() const noexcept { return M_begin; }
  constexpr iterator end() const noexcept { return M_end; }
};

template <class T>
constexpr decltype(auto) rev(T &&cont) {
  return rev_impl<T>(std::forward<T>(cont));
}

/**
 * @title Reverser
 */
#line 17 "main.cpp"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

int main() {
  size_t N;
  i32 D;
  std::cin >> N >> D;
  std::vector<std::vector<i32>> count(D, std::vector<i32>(D));
  for (auto i: range(0, N)) {
    i32 x, y;
    std::cin >> x >> y;
    count[x % D][y % D]++;
  }
  i32 ok = inf32, ng = 0;
  while (ok - ng > 1) {
    i32 md = (ok + ng) >> 1;
    ([&] {
      const i64 rem = md % D;
      const i64 len = md / D + 1;
      std::vector<std::vector<i32>> sum(2 * D + 1, std::vector<i32>(2 * D + 1));
      for (auto i: range(0, D)) {
        for (auto j: range(0, D)) {
          const auto add = [&](const auto a, const auto b, const auto c, const auto d) {
            sum[D + i - a][D + j - b]++;
            sum[D + i - c + 1][D + j - b]--;
            sum[D + i - a][D + j - d + 1]--;
            sum[D + i - c + 1][D + j - d + 1]++;
          };
          if (len * len >= count[i][j]) {
            add(rem, rem, 0, 0);
          }
          if (len * (len - 1) >= count[i][j]) {
            add(rem, D - 1, 0, rem + 1);
          }
          if ((len - 1) * len >= count[i][j]) {
            add(D - 1, rem, rem + 1, 0);
          }
          if ((len - 1) * (len - 1) >= count[i][j]) {
            add(D - 1, D - 1, rem + 1, rem + 1);
          }
        }
      }
      for (auto i: range(0, 2 * D + 1)) {
        for (auto j: range(0, 2 * D + 1)) {
          if (i > 0) {
            sum[i][j] += sum[i - 1][j];
          }
          if (j > 0) {
            sum[i][j] += sum[i][j - 1];
          }
          if (i > 0 && j > 0) {
            sum[i][j] -= sum[i - 1][j - 1];
          }
        }
      }
      for (auto i: range(0, D)) {
        for (auto j: range(0, D)) {
          if (sum[i][j] + sum[i + D][j] + sum[i][j + D] + sum[i + D][j + D] == D * D) {
            return true;
          }
        }
      }
      return false;
    }() ? ok : ng) = md;
  }
  std::cout << ok << '\n';
  return 0;
}


Measured memory_bytes: 23048