#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC push_options
#pragma GCC optimize("unroll-loops")
using namespace std;
void doin() {
  cin.tie();
  cout.tie();
  ios::sync_with_stdio(0);
}
template <typename X, typename Y>
istream& operator>>(istream& in, pair<X, Y>& a) {
  in >> a.first >> a.second;
  return in;
}
template <typename T>
void getv(T& i) {
  cin >> i;
}
template <typename T, typename... Ns>
void getv(vector<T>& v, int n, Ns... ns) {
  v.resize(n);
  for (auto& i : v) getv(i, ns...);
}
template <typename T>
void getv1(T& i) {
  cin >> i;
}
template <typename T, typename... Ns>
void getv1(vector<T>& v, int n, Ns... ns) {
  v.resize(n + 1);
  for (int i = 1; i <= n; i++) getv(v[i], ns...);
}
inline void getch(char& x) {
  while (x = getchar_unlocked(), x < 33) {
    ;
  }
}
inline void getstr(string& str) {
  str.clear();
  char cur;
  while (cur = getchar_unlocked(), cur < 33) {
    ;
  }
  while (cur > 32) {
    str += cur;
    cur = getchar_unlocked();
  }
}
template <typename T>
inline bool sc(T& num) {
  bool neg = 0;
  int c;
  num = 0;
  while (c = getchar_unlocked(), c < 33) {
    if (c == EOF) return false;
  }
  if (c == '-') {
    neg = 1;
    c = getchar_unlocked();
  }
  for (; c > 47; c = getchar_unlocked()) num = num * 10 + c - 48;
  if (neg) num *= -1;
  return true;
}
using AntonTsypko = void;
using arsijo = AntonTsypko;
using god = arsijo;
uniform_real_distribution<double> double_dist(0, 1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
int main() {
  doin();
  long long n, I;
  cin >> n >> I;
  I *= 8;
  I /= n;
  I = min(I, 61ll);
  I = min(1ll << I, 2000000001ll);
  vector<long long> a;
  getv(a, n);
  sort(a.begin(), a.end());
  vector<long long> b;
  int c = 1;
  for (int i = 1; i < n; i++) {
    if (a[i] == a[i - 1])
      c++;
    else {
      b.push_back(c);
      c = 1;
    }
  }
  b.push_back(c);
  int ans = INT_MIN, r = 0;
  for (int i = 0; i < b.size(); i++) {
    r += b[i];
    ans = max(ans, r);
    if (i - I + 1 >= 0) r -= b[i - I + 1];
  }
  cout << n - ans;
  return 0;
}
