//#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

constexpr usize operator"" _z(unsigned long long x) noexcept {
  return static_cast<usize>(x);
}

class rep {
  const usize f, l;

public:
  class itr {
    friend rep;
    usize i;
    constexpr itr(const usize x) noexcept : i(x) {}

  public:
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  constexpr rep(const usize first, const usize last) noexcept
      : f(first), l(last) {}
  constexpr itr begin() const noexcept { return itr(f); }
  constexpr itr end() const noexcept { return itr(l); }
};
class revrep {
  const usize f, l;

public:
  class itr {
    friend revrep;
    usize i;
    constexpr itr(usize x) noexcept : i(x) {}

  public:
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {}
  constexpr itr begin() const noexcept { return itr(l); }
  constexpr itr end() const noexcept { return itr(f); }
};
template <class T> using vec_alias = std::vector<T>;
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) {
  return a < b ? b - a : a - b;
}
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}

} // namespace n91

#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>

namespace n91 {

void main_() {
  const usize n = scan<usize>();
  u32 k = scan<u32>();
  std::vector<u32> a(n);
  for (auto &e : a) {
    std::cin >> e;
  }
  u32 sum = std::accumulate(a.cbegin(), a.cend(), static_cast<u32>(0));
  const auto is_ok = [&](const u32 d) {
    std::vector<u32> b(n);
    for (const auto i : rep(0_z, n)) {
      b[i] = a[i] % d;
    }
    std::sort(b.begin(), b.end());
    u32 p_sum = static_cast<u32>(0), s_sum = static_cast<u32>(0);
    usize p_i = 0_z, s_i = n - 1_z;
    while (p_i < s_i) {
      if (p_sum > s_sum) {
        s_sum += d - b[s_i];
        --s_i;
      } else {
        p_sum += b[p_i];
        ++p_i;
      }
    }
    return std::max(p_sum, s_sum) <= k;
  };
  u32 ans = static_cast<u32>(1);
  for (u32 i = static_cast<u32>(1); i * i <= sum; ++i) {
    if (sum % i == static_cast<u32>(0)) {
      if (is_ok(i)) {
        ans = std::max(ans, i);
      }
      if (is_ok(sum / i)) {
        ans = std::max(ans, sum / i);
      }
    }
  }
  std::cout << ans << std::endl;
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 256