#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <cmath>

using ll = long long;

// Function to calculate the divisors of a number
std::set<ll> get_divisors(ll number) {
    std::set<ll> divisors;
    for (ll i = 1; i * i <= number; ++i) {
        if (number % i == 0) {
            divisors.insert(i);
            if (i != number / i) {
                divisors.insert(number / i);
            }
        }
    }
    return divisors;
}

// Function to calculate the minimum operations to make all elements divisible by x
ll calculate_operations(const std::vector<ll>& elements, ll x) {
    ll count = 0;
    for (ll element : elements) {
        count += std::min(element % x, x - element % x);
    }
    return count;
}

int main() {
    ll N, K;
    std::cin >> N >> K;
    std::vector<ll> A(N);

    for (ll& element : A) {
        std::cin >> element;
    }

    ll answer = 1;
    for (ll element : A) {
        auto divisors = get_divisors(element);
        for (ll divisor : divisors) {
            ll operations_needed = calculate_operations(A, divisor);
            if (operations_needed <= K) {
                answer = std::max(answer, divisor);
            }
        }
    }

    std::cout << answer << std::endl;
    return 0;
}