#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
void pre() {}
map<long long, long long> m;
vector<long long> w;
void solve() {
  long long n, s, x;
  cin >> n >> s;
  s *= 8;
  for (int i = 0; i < (n); ++i) cin >> x, m[x] = m[x] + 1;
  for (auto &it : m) w.push_back(it.second);
  w.push_back(0);
  long long j = 0, k = 0, p = 1, su = n, ans = 1e8;
  while (n * (k + 1) <= s && p < n + 1) k++, p *= 2;
  for (int i = 0; i < ((int)(w).size() - 1); ++i) {
    while (j < (int)(w).size() - 1 && j - i < p) su -= w[j], j++;
    ans = min(ans, su);
    su += w[i];
  }
  cout << ans;
}
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin.exceptions(cin.failbit);
  pre();
  solve();
  return 0;
}
