#ifndef LOCAL #pragma GCC optimize("O3") #endif #include using namespace std; #define sim template muu & operator<<( #define ris return *this #define R22(r) sim> typename enable_if<1 r sizeof(dud(0)),muu&>::type operator<<(c g) { sim> struct rge {c b, e;}; sim> rge range(c i, c j) {return rge{i, j};} sim> auto dud(c*r)->decltype(cerr << *r); sim> char dud(...); struct muu { #ifdef LOCAL stringstream a; ~muu() {cerr << a.str() << endl;} R22(<) a << boolalpha << g; ris;} R22(==) ris << range(begin(g), end(g));} sim mor rge u) { a << "["; for (c i = u.b; i != u.e; ++i) *this << ", " + 2 * (i == u.b) << *i; ris << "]"; } sim, class b mor pair r){ris << "(" << r.first << ", " << r.second << ")";} #else sim mor const c&){ris;} #endif }; #define debug muu() << __FUNCTION__ << "#" << __LINE__ << ": " #define imie(r...) "[" #r ": " << (r) << "] " #define range(a, b) "[[" #a ", " #b "): " << range(a, b) << "] " #define arr(a, i) "[" #a imie(i) ": " << a[i] << "] " using ll = long long; using ld = long double; using pii = pair ; const int nax = 1e6 + 44; int a[nax]; int main() { int n, k; scanf("%d%d", &n, &k); for (int i = 0; i < n; ++i) scanf("%d", a + i); int ans = 0; for (int b = 30; b >= 0; --b) { int ile = 0; for (int i = 0; i < n; ++i) if(a[i] >> b & 1) ile++; debug << imie(b) imie(ile); if (ile >= k) { ans |= 1 << b; for (int i = 0; i < n; ++i) if (a[i] >> b & 1); else a[i] = 0; debug << range(a, a + n); } } printf("%d\n", ans); }