#include <iostream>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr start, itr goal){ for(auto i = start; i != goal; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
#define mod long(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))
#define fcout cout << fixed << setprecision(20)
#define highest(x) (63 - __builtin_clzl(x))

template< class T >
struct CumulativeSum2D
{
    vector< vector< T > > data;
    
    CumulativeSum2D(int W, int H) : data(W + 1, vector< int >(H + 1, 0)) {}
    
    void add(int x, int y, int z)
    {
        ++x, ++y;
        if(x >= data.size() || y >= data[0].size()) return;
        data[x][y] += z;
    }
    
    void build()
    {
        for(int i = 1; i < data.size(); i++) {
            for(int j = 1; j < data[i].size(); j++) {
                data[i][j] += data[i][j - 1] + data[i - 1][j] - data[i - 1][j - 1];
            }
        }
    }
    
    T query(int sx, int sy, int gx, int gy)
    {
        return (data[gx][gy] - data[sx][gy] - data[gx][sy] + data[sx][sy]);
    }
};

int main(){
    int N, D;
    cin >> N >> D;
    int counts[D][D];
    memset(counts, 0, sizeof(counts));
    for(int i = 0; i < N; i++){
        int x, y;
        cin >> x >> y;
        counts[x % D][y % D]++;
    }
    int maximum = 0;
    for(int i = 0; i < D; i++){
        for(int j = 0; j < D; j++){
            maximum = max(maximum, counts[i][j]);
        }
    }
    int maximum_sqrt = 0;
    while((maximum_sqrt + 1) * (maximum_sqrt + 1) < maximum){
        maximum_sqrt++;
    }
    CumulativeSum2D<int> first_overflow(D * 2, D * 2); // maximum_sqrt * maximum_sqrt < counts[i][j]
    CumulativeSum2D<int> second_overflow(D * 2, D * 2); // maximum_sqrt * (maximum_sqrt + 1) < counts[i][j]
    for(int i = 0; i < D * 2; i++){
        for(int j = 0; j < D * 2; j++){
            first_overflow.add(i, j, maximum_sqrt * maximum_sqrt < counts[i % D][j % D]);
            second_overflow.add(i, j, maximum_sqrt * (maximum_sqrt + 1) < counts[i % D][j % D]);
        }
    }
    first_overflow.build();
    second_overflow.build();
    int second_overflow_sum = second_overflow.query(0, 0, D, D);
    int ans = 1e9;
    for(int i = 0; i < D; i++){
        for(int j = 0; j < D; j++){
            int left = -1, right = D - 1; // (left, right]
            while(left + 1 < right){
                int middle = (left + right) / 2;
                if(second_overflow.query(i, j, i + middle + 1, j + middle + 1) == second_overflow_sum && first_overflow.query(i + middle + 1, j + middle + 1, i + D, j + D) == 0){
                    right = middle;
                }else{
                    left = middle;
                }
            }
            ans = min(ans, right);
        }
    }
    cout << ans + maximum_sqrt * D << endl;
}



Measured memory_bytes: 35584