#include <stdio.h>
 
int min(int arr[], int len) {
    if (len == 1) return arr[0];
    int m = arr[0];
    for (int i = 0; i < len; i++)
        if (arr[i] < m) m = arr[i];
    return m;
}
 
int solution(int arr[], int len, int delta) {
    int count[delta];
    int distance;
 
    for (int i = 0; i < delta; i++) count[i] = 0;
 
    for (int i = 0; i < len; i++) {
        distance = delta - arr[i] % delta;
        for (int j = 0; j < delta; j++) {
            count[j] += (distance + j) % delta;
        }
    }
 
    return min(count, delta);
}
 
int main() {
    int len, delta;
    scanf("%d", &len); scanf("%d", &delta);
    int arr[len];
    for (int i = 0; i < len; i++) scanf("%d", &arr[i]);
    printf("%d", solution(arr, len, delta));
}
 

I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgbWluKGludCBhcnJbXSwgaW50IGxlbikgewogICAgaWYgKGxlbiA9PSAxKSByZXR1cm4gYXJyWzBdOwogICAgaW50IG0gPSBhcnJbMF07CiAgICBmb3IgKGludCBpID0gMDsgaSA8IGxlbjsgaSsrKQogICAgICAgIGlmIChhcnJbaV0gPCBtKSBtID0gYXJyW2ldOwogICAgcmV0dXJuIG07Cn0KCmludCBzb2x1dGlvbihpbnQgYXJyW10sIGludCBsZW4sIGludCBkZWx0YSkgewogICAgaW50IGNvdW50W2RlbHRhXTsKICAgIGludCBkaXN0YW5jZTsKICAgIAogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBkZWx0YTsgaSsrKSBjb3VudFtpXSA9IDA7CiAgICAKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbGVuOyBpKyspIHsKICAgICAgICBkaXN0YW5jZSA9IGRlbHRhIC0gYXJyW2ldICUgZGVsdGE7CiAgICAgICAgZm9yIChpbnQgaiA9IDA7IGogPCBkZWx0YTsgaisrKSB7CiAgICAgICAgICAgIGNvdW50W2pdICs9IChkaXN0YW5jZSArIGopICUgZGVsdGE7CiAgICAgICAgfQogICAgfQogICAgCiAgICByZXR1cm4gbWluKGNvdW50LCBkZWx0YSk7Cn0KCmludCBtYWluKCkgewogICAgaW50IGxlbiwgZGVsdGE7CiAgICBzY2FuZigiJWQiLCAmbGVuKTsgc2NhbmYoIiVkIiwgJmRlbHRhKTsKICAgIGludCBhcnJbbGVuXTsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbGVuOyBpKyspIHNjYW5mKCIlZCIsICZhcnJbaV0pOwogICAgcHJpbnRmKCIlZCIsIHNvbHV0aW9uKGFyciwgbGVuLCBkZWx0YSkpOwp9Cg==

NiA0CjkgMyA3IDYgMTE=

6 4
9 3 7 6 11