#include <bits/stdc++.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = 1e18;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair


int main() {
  ll n, d;
  cin >> n >> d;
  vii num(d, vi(d));
  rep (i, n) {
    int x, y;
    cin >> x >> y;
    num[x % d][y % d]++;
  }
  /*
  cout << endl;
  rep (i, d) {
    rep (j, d) {
      cout << num[i][j] << " ";
    }
    cout << endl;
  }
  //*/
  ll ans = INF;
  vector<vector<pii> > ab(d, vector<pii>(d));
  int ma = 0;
  rep (i, d) {
    rep (j, d) {
      chmax(ma, num[i][j]);
    }
  }
  int a = max(0, (int)sqrt(ma) - 4);
  while (ma > (a + 1) * (a + 1)) a++;
  //DEBUG(a);
  vii a1(2*d, vi(2*d)), a2(2*d, vi(2*d));
  rep (i, 2*d) {
    rep (j, 2*d) {
      a1[i][j] = num[i%d][j%d] > a*a;
      a2[i][j] = num[i%d][j%d] > a*(a + 1);
    }
  }
  
  vii sum1(2*d + 1, vi(2*d + 1)), sum2(2*d + 1, vi(2*d + 1));
  rep (i, 2*d) {
    rep (j, 2*d) {
      sum1[i + 1][j + 1] = sum1[i + 1][j] + a1[i][j];
      sum2[i + 1][j + 1] = sum2[i + 1][j] + a2[i][j];
    }
  }
  rep (i, 2*d) {
    rep (j, 2*d) {
      sum1[i + 1][j + 1] += sum1[i][j + 1];
      sum2[i + 1][j + 1] += sum2[i][j + 1];
    }
  }
  int ng = -1, ok = d;
  while (ng + 1 < ok) {
    int b = (ng + ok) / 2;
    bool flag = false;
    rep (i, d) {
      rep (j, d) {
        int c1 = sum1[i + d][j + d] - sum1[i + d][j + b] - sum1[i + b][j + d] + sum1[i + b][j + b];
        int c2 = sum2[i + d][j + b] - sum2[i + d][j] - sum2[i + b][j + b] + sum2[i + b][j];
        int c3 = sum2[i + b][j + d] - sum2[i + b][j + b] - sum2[i][j + d] + sum2[i][j + b];
        //DEBUG(c1);
        //DEBUG(c2);
        //DEBUG(c3);
        if (c1 == 0 && c2 + c3 == 0) {
          flag = true;
        }
      }
    }
    if (flag) {
      ok = b;
    }
    else {
      ng = b;
    }
  }
  cout << a * d + ok - 1 << endl;
}


Measured memory_bytes: 74880