import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.Reader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        MyInput in = new MyInput(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskD {
        public void solve(int testNumber, MyInput in, PrintWriter out) {
            final int n = in.nextInt();
            final int d = in.nextInt();

            int[][] cnt = new int[d][d];
            for (int i = 0; i < n; i++) {
                int x = in.nextInt() % d;
                int y = in.nextInt() % d;
                cnt[y][x]++;
            }

            int[][][] sum = new int[3][2 * d + 1][2 * d + 1];

            int low = 0, high = 1_000_000;

            LOOP:
            while (high - low > 1) {
                final int mid = (low + high) >>> 1;

                long a = mid / d;
                int b = mid % d;
                final long[] th = new long[]{(a + 1) * (a + 1), a * (a + 1), a * a,};
                for (int t = 0; t < sum.length; t++) {
                    for (int y = 0; y < d; y++) {
                        for (int x = 0; x < d; x++) {
                            final int v = cnt[y][x] <= th[t] ? 1 : 0;
                            sum[t][y + 1][x + 1] = v;
                            sum[t][y + d + 1][x + 1] = v;
                            sum[t][y + 1][x + d + 1] = v;
                            sum[t][y + d + 1][x + d + 1] = v;
                        }
                    }
                    for (int y = 0; y < sum[t].length; y++) {
                        for (int x = 0; x + 1 < sum[t][y].length; x++) {
                            sum[t][y][x + 1] += sum[t][y][x];
                        }
                    }
                    for (int y = 0; y + 1 < sum[t].length; y++) {
                        for (int x = 0; x < sum[t][y].length; x++) {
                            sum[t][y + 1][x] += sum[t][y][x];
                        }
                    }
                }

                for (int y = 0; y < d; y++) {
                    for (int x = 0; x < d; x++) {
                        boolean ok = true;
                        final int c = d - b;
                        ok &= sum[0][y + b][x + b] - sum[0][y + b][x] - sum[0][y][x + b] + sum[0][y][x] == b * b;
                        ok &= sum[1][y + d][x + b] - sum[1][y + d][x] - sum[1][y + b][x + b] + sum[1][y + b][x] == c * b;
                        ok &= sum[1][y + b][x + d] - sum[1][y][x + d] - sum[1][y + b][x + b] + sum[1][y][x + b] == c * b;
                        ok &= sum[2][y + d][x + d] - sum[2][y + d][x + b] - sum[2][y + b][x + d] + sum[2][y + b][x + b] == c * c;
                        if (ok) {
                            high = mid;
                            continue LOOP;
                        }
                    }
                }
                low = mid;
            }
            out.println(high - 1);
        }

    }

    static class MyInput {
        private final BufferedReader in;
        private static int pos;
        private static int readLen;
        private static final char[] buffer = new char[1024 * 8];
        private static char[] str = new char[500 * 8 * 2];
        private static boolean[] isDigit = new boolean[256];
        private static boolean[] isSpace = new boolean[256];
        private static boolean[] isLineSep = new boolean[256];

        static {
            for (int i = 0; i < 10; i++) {
                isDigit['0' + i] = true;
            }
            isDigit['-'] = true;
            isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true;
            isLineSep['\r'] = isLineSep['\n'] = true;
        }

        public MyInput(InputStream is) {
            in = new BufferedReader(new InputStreamReader(is));
        }

        public int read() {
            if (pos >= readLen) {
                pos = 0;
                try {
                    readLen = in.read(buffer);
                } catch (IOException e) {
                    throw new RuntimeException();
                }
                if (readLen <= 0) {
                    throw new MyInput.EndOfFileRuntimeException();
                }
            }
            return buffer[pos++];
        }

        public int nextInt() {
            int len = 0;
            str[len++] = nextChar();
            len = reads(len, isSpace);
            int i = 0;
            int ret = 0;
            if (str[0] == '-') {
                i = 1;
            }
            for (; i < len; i++) ret = ret * 10 + str[i] - '0';
            if (str[0] == '-') {
                ret = -ret;
            }
            return ret;
        }

        public char nextChar() {
            while (true) {
                final int c = read();
                if (!isSpace[c]) {
                    return (char) c;
                }
            }
        }

        int reads(int len, boolean[] accept) {
            try {
                while (true) {
                    final int c = read();
                    if (accept[c]) {
                        break;
                    }
                    if (str.length == len) {
                        char[] rep = new char[str.length * 3 / 2];
                        System.arraycopy(str, 0, rep, 0, str.length);
                        str = rep;
                    }
                    str[len++] = (char) c;
                }
            } catch (MyInput.EndOfFileRuntimeException e) {
            }
            return len;
        }

        static class EndOfFileRuntimeException extends RuntimeException {
        }

    }
}



Measured memory_bytes: 88180