#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>

using namespace std;
typedef unsigned int uint;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PP;
#define REP(i, a, n) for(LL i = (a), i##_max = (n); i < i##_max; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##min = (a); i >= i##min; --i)
#define ALL(arr) (arr).begin(), (arr).end()
#define FLOAT fixed << setprecision(16)
#define SPEEDUP {cin.tie(NULL); ios::sync_with_stdio(false);}
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const string INFSTR = "\x7f";
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U>
istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U>
ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N>
void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template<class T>
T Compare(T left, T right) { return left > right ? 1 : (left < right ? -1 : 0); }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }
template <class T>
T Next() { T buf; cin >> buf; return buf; }

#ifdef ONLY_MY_ENVIR
#include "IntMod.h"
#include "Union_Find.h"
#include "Graph.h"
#include "Range.h"
#include "Global.h"
#include "Flow_Solver.h"
#include "Tree.h"
#include "Suffix_Array.h"
#include "Geometry.h"
#include "Matrix.h"
#include "Segment_Tree.h"
#include "BIT.h"
#include "Rational.h"
#include "Position.h"
#include "Factorization.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>> (istream& ist, __int128& val) { LL tmp;  ist >> tmp; val = tmp; return ist; }
ostream& operator<< (ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif

#if 1234567891
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>
template<typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T> >;
// template <class T>
// auto Is(const T& value) { return [value](const auto& comparand) -> bool { return comparand == value; }; }
#endif

int N, D;
int C[1000][1000];
int A[2001][2001];
int B[2001][2001];

int is_cat(int P[2001][2001], int u, int d, int l, int r) {
	return P[u][l] - P[u][r] - P[d][l] + P[d][r] >= (d - u) * (r - l);
}

bool ok(int size) {
	int delta = D - size;
	REP(i, 0, D) {
		REP(j, 0, D) {
			if (!is_cat(A, i, i + delta, j, j + delta)) continue;
			if (!is_cat(B, i + delta, i + D, j, j + delta)) continue;
			if (!is_cat(B, i, i + delta, j + delta, j + D)) continue;
			return true;
		}
	}
	return false;
}

int main() {
	cin >> N >> D;
	REP(i, 0, N) {
		int x, y;
		scanf("%d %d", &x, &y);
		++C[x % D][y % D];
	}
	
	int cmx = 0;
	REP(i, 0, D) {
		REP(j, 0, D) {
			cmx = max(cmx, C[i][j]);
		}
	}

	int t = 0;
	while (t * t < cmx) {
		++t;
	}
	--t;

	REP(i, 0, D) {
		REP(j, 0, D) {
			A[i + 1][j + 1] = A[i + 1][j + 1 + D] = A[i + 1 + D][j + 1] = A[i + 1 + D][j + 1 + D] = C[i][j] <= t * t;
			B[i + 1][j + 1] = B[i + 1][j + 1 + D] = B[i + 1 + D][j + 1] = B[i + 1 + D][j + 1 + D] = C[i][j] <= t * (t + 1);
		}
	}

	REP(i, 0, 2 * D + 1) {
		REP(j, 0, 2 * D) {
			A[i][j + 1] += A[i][j];
			B[i][j + 1] += B[i][j];
		}
	}

	REP(j, 0, 2 * D + 1) {
		REP(i, 0, 2 * D) {
			A[i + 1][j] += A[i][j];
			B[i + 1][j] += B[i][j];
		}
	}

	int lo = 0;
	int hi = D + 1;
	while (hi - lo > 1) {
		int mid = (lo + hi) / 2;
		if (ok(mid)) {
			hi = mid;
		} else {
			lo = mid;
		}
	}
	cout << t * D + hi - 1 << endl;
	return 0;
}

Measured memory_bytes: 35456