#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
ll sum1[2000][2000],sum2[2000][2000];
ll get1(int i,int j,int k,int l){
    if(k==0||l==0)return 0;
    ll res=sum1[k-1][l-1];
    if(i)res-=sum1[i-1][l-1];
    if(j)res-=sum1[k-1][j-1];
    if(i&&j)res+=sum1[i-1][j-1];
    return res;
}
ll get2(int i,int j,int k,int l){
    if(k==0||l==0)return 0;
    ll res=sum2[k-1][l-1];
    if(i)res-=sum2[i-1][l-1];
    if(j)res-=sum2[k-1][j-1];
    if(i&&j)res+=sum2[i-1][j-1];
    return res;
}
int main(){
    ll n,d;cin>>n>>d;
    vvi num(d,vi(d));
    rep(i,n){
        ll x,y;cin>>x>>y;
        num[x%d][y%d]++;
    }
    ll ok=1000000,ng=0;
    while(ok-ng>1){
        ll md=(ok+ng)/2;
        bool able=false;
        ll a=md/d,b=md%d;
        rep(i,d*2)rep(j,d*2){sum1[i][j]=0;sum2[i][j]=0;}
        rep(i,d)rep(j,d){
            if(num[i][j]>(a+1)*(a+1))able=true;
            if(num[i][j]>a*a){
                sum1[i][j]++;
                sum1[i+d][j]++;
                sum1[i][j+d]++;
                sum1[i+d][j+d]++;
            }
            if(num[i][j]>a*(a+1)){
                sum2[i][j]++;
                sum2[i+d][j]++;
                sum2[i][j+d]++;
                sum2[i+d][j+d]++;
            }
        }
        rep(i,d*2)rep(j,d*2-1){
            sum1[i][j+1]+=sum1[i][j];
            sum2[i][j+1]+=sum2[i][j];
        }
        rep(j,d*2)rep(i,d*2-1){
            sum1[i+1][j]+=sum1[i][j];
            sum2[i+1][j]+=sum2[i][j];
        }
        if(able){
            ng=md;continue;
        }
        rep(i,d){
            if(able)break;
            rep(j,d){
                if(able)break;
                if(get1(i+b,j+b,i+d,j+d)==0&&get2(i,j,i+d,j+d)==get2(i,j,i+b,j+b))able=true;
            }
        }
        if(able)ok=md;
        else ng=md;
    }
    out(ok-1);
}

Measured memory_bytes: 70656