#include <bits/stdc++.h>
#define range(i, l, r) for(int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
    os << "(";
    os << p.first << ", " << p.second;
    return os << ")";
}

template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
    os << "[";
    for (int i = 0; i < v.size() - 1; i++) {
        os << v.at(i) << ", ";
    }
    return os << v.at(v.size() - 1) << "]";
}

template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

lint pow(lint num, lint e, lint MOD) {
    lint res = 1;
    lint cur_num = num;
    while (e) {
        if (e & 1) {
            res *= cur_num;
            res %= MOD;
        }
        cur_num *= cur_num;
        cur_num %= MOD;
        e >>= 1;
    }
    return res;
}

vec<lint> enumerate_divisors(lint n) {
    vec<lint> res;
    for (lint i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            res.emplace_back(i);
            res.emplace_back(n / i);
        }
    }
    return res;
}

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    lint N, K;
    cin >> N >> K;
    vec<lint> A_list(N);
    range(i, 0, N) cin >> A_list.at(i);

    lint sum_A = 0;
    range(i, 0, N) sum_A += A_list.at(i);
    vec<lint> divisors = enumerate_divisors(sum_A);
    sort(A_list.begin(), A_list.end(), greater<lint>());
    sort(divisors.begin(), divisors.end(), greater<lint>());
    lint max_gcd = 1;

    // range(i, 0, divisors.size()) {
    //     cout << divisors.at(i) << " ";
    // }
    // cout << "\n";

    for (const auto divisor : divisors) {
        vec<plint> diff(N);
        range(i, 0, N) {
            lint A = A_list.at(i);
            diff.at(i).first = A - A / divisor * divisor;
            diff.at(i).second = (divisor - diff.at(i).first) % divisor;
        }
        sort(diff.begin(), diff.end());
        vec<lint> suffix_sum(N, 0);
        suffix_sum.at(N - 1) = diff.at(N - 1).second;
        reversed_range(i, 0, N - 1) {
            suffix_sum.at(i) = suffix_sum.at(i + 1) + diff.at(i).second;
        }
        lint cur_sum = 0;
        range(i, 0, N - 1) {
            cur_sum += diff.at(i).first;
            if (cur_sum == suffix_sum.at(i + 1)) {
                if (cur_sum <= K) {
                    cout << divisor << "\n";
                    return 0;
                } else {
                    break;
                }
            }
        }
    }
    cout << 1 << "\n";
}

Measured memory_bytes: 256