const long long MOD = 998244353;
const int N = 2010;

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <unordered_set>
#include <bitset>
#include <deque>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;

#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())

#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL

int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};

ll inq(ll x, ll y)
{
    if (!y) re 1 % MOD;
    ll l = inq(x, y / 2);
    if (y % 2) re l * l % MOD * x % MOD;
    re l * l % MOD;
}

ll rev(ll x)
{
    return inq(x, MOD - 2);
}

bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;

void __precompute_combinatorics()
{
    __precomputed_combinatorics = 1;
    __fact.resize(N);
    __ufact.resize(N);
    __rev.resize(N);
    __rev[1] = 1;
    for (int i = 2; i < N; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
    __fact[0] = 1, __ufact[0] = 1;
    for (int i = 1; i < N; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}

ll fact(int x)
{
    if (!__precomputed_combinatorics) __precompute_combinatorics();
    return __fact[x];
}

ll cnk(int n, int k)
{
    if (k < 0 || k > n) return 0;
    if (!__precomputed_combinatorics) __precompute_combinatorics();
    return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}

int n, d;
int c[N][N];
int p1[N][N];
int p2[N][N];

int g1(int i, int j)
{
    if (i >= 0 && j >= 0) return p1[i][j];
    return 0;
}

int g2(int i, int j)
{
    if (i >= 0 && j >= 0) return p2[i][j];
    return 0;
}

int get1(int i1, int j1, int i2, int j2)
{
    i2--, j2--;
    return g1(i2, j2) - g1(i1 - 1, j2) - g1(i2, j1 - 1) + g1(i1 - 1, j1 - 1);
}

int get2(int i1, int j1, int i2, int j2)
{
    i2--, j2--;
    return g2(i2, j2) - g2(i1 - 1, j2) - g2(i2, j1 - 1) + g2(i1 - 1, j1 - 1);
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> d;
    for (int i = 0; i < n; i++)
    {
        int x, y;
        cin >> x >> y;
        x = (x % d + d) % d;
        y = (y % d + d) % d;
        c[x][y]++;
    }
    int mx = 0;
    for (int i = 0; i < d; i++) for (int j = 0; j < d; j++) mx = max(mx, c[i][j]);
    int A = 0;
    for (A = 0; ; A++) if ((A + 1) * (A + 1) >= mx) break;
    int c1 = 0, c2 = 0;
    for (int i = 0; i < d; i++)
    {
        for (int j = 0; j < d; j++)
        {
            if (c[i][j] > (A + 1) * A) c2++, p2[i][j]++;
            if (c[i][j] > A * A) c1++, p1[i][j]++;
        }
    }
    for (int i = 0; i < 2 * d; i++)
    {
        for (int j = 0; j < 2 * d; j++)
        {
            p1[i][j] = p1[i % d][j % d];
            p2[i][j] = p2[i % d][j % d];
        }
    }
    for (int i = 0; i < 2 * d; i++)
    {
        for (int j = 0; j < 2 * d; j++)
        {
            p1[i][j] = p1[i][j] + (i ? p1[i - 1][j] : 0) + (j ? p1[i][j - 1] : 0) - (i && j ? p1[i - 1][j - 1] : 0);
            p2[i][j] = p2[i][j] + (i ? p2[i - 1][j] : 0) + (j ? p2[i][j - 1] : 0) - (i && j ? p2[i - 1][j - 1] : 0);
        }
    }
    int ans = 1e9;
    //cout << c1 << " " << c2 << endl << endl;
    for (int i = 0; i < d; i++)
    {
        for (int j = 0; j < d; j++)
        {
            int L = A * d - 1, R = A * d + d;
            //cout << L << " " << R << endl;
            while (L + 1 < R)
            {
                int M = (L + R) / 2;
                int b = M % d;
                int a = M / d;
                if (a != A) exit(1);
                int cnt2 = get2(i, j, i + b, j + b);
                int cnt1 = get1(i, j, i + b, j + b) + get1(i, j + b, i + b, j + d) + get1(i + b, j, i + d, j + b);
                //cout << i << " " << j << " " << M << " " << cnt1 << " " << cnt2 << endl;
                if (cnt1 == c1 && cnt2 == c2) R = M;
                else L = M;
            }
            ans = min(ans, R);
        }
    }
    cout << ans - 1;
}

/* Note:
Check constants at the beginning of the code.
    N is set to 4e5 but be careful in problems with large constant factor.
    Setting N in every problem is more effective.
Check corner cases.
    N = 1
No def int long long for now.
Add something here.
*/


Measured memory_bytes: 41216