#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 100;
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
const long double EPS = 1e-12;
const long double PI = acos(-1);
const unsigned long long PRIME = 31;
void bye() {
  cout << "\n";
  exit(0);
}
vector<long long> pref;
long long get_sum(long long l, long long r) {
  if (l > r) {
    swap(l, r);
  }
  return pref[r] - ((l) ? pref[l - 1] : 0);
}
long long get(long long l, long long r, long long val) {
  return get_sum(0, (long long)(pref).size() - 1) - get_sum(l, r) + val;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, c;
  cin >> n >> c;
  vector<long long> g(n);
  for (long long i = 0; i < n; i++) {
    cin >> g[i];
    g[i] -= c;
  }
  pref.resize(n);
  pref[0] = (g[0] == 0);
  for (long long i = 1; i < n; i++) {
    if (g[i] == 0) {
      pref[i]++;
    }
    pref[i] += pref[i - 1];
  }
  unordered_map<long long, vector<long long> > mp;
  for (long long i = 0; i < n; i++) {
    mp[g[i]].push_back(i);
  }
  long long ans = pref.back();
  for (auto kek : mp) {
    if (g[kek.second[0]] == 0) {
      continue;
    }
    vector<int> segs;
    segs.push_back(-get_sum(0, kek.second[0]));
    segs.push_back(1);
    for (int i = 0; i < (long long)(kek.second).size() - 1; i++) {
      segs.push_back(-get_sum(kek.second[i], kek.second[i + 1]));
      segs.push_back(1);
    }
    segs.push_back(-get_sum(kek.second.back(), (long long)(pref).size() - 1));
    int bal = 0;
    for (auto v : segs) {
      bal = max(0, bal + v);
      ans = max(ans, pref.back() + bal);
    }
  }
  cout << ans;
  bye();
}
