#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using P = pair<int, int>;
#define all(x) x.begin(), x.end()
#define rep(i, l, n) for (int i = l; i < (n); ++i)
#define sz(x) (int)x.size()
const char nl = '\n';
const int mod = 998244353;
struct segtree {
vector<int> tree;
int size;
void init(int n) {
size = 1;
while (size<n)size <<= 1;
tree.assign(2*size-1, 0);
}
void upd(int i, int v, int x, int lx, int rx) {
if (rx-lx==1) {
tree[x] = max(tree[x], v);
return;
}
int mid = lx+rx>>1;
if(i<mid)upd(i,v,2*x+1,lx,mid);
else upd(i,v,2*x+2,mid,rx);
tree[x] = max(tree[2*x+1], tree[2*x+2]);
}
void upd(int i, int v) {
upd(i, v, 0, 0, size);
}
int get(int l,int r,int x, int lx, int rx) {
if (rx <= l || r <= lx)return 0;
if (l <= lx && rx <= r)return tree[x];
int mid = lx+rx>>1;
return max(get(l, r, 2*x+1,lx,mid),
get(l, r, 2*x+2,mid,rx));
}
int get(int l, int r) {
return get(l,r,0,0,size);
}
};
int n, x;
vector<int> c(vector<int> a) {
vector<int> b = a;
sort(all(a)); int t = 1;
map<int, int> mp;
rep(i, 0, n)
if (i == 0 || a[i] != a[i-1])mp[a[i]] = t++;
for (auto &i: b)i = mp[i];
return b;
}
void solve() {
cin >> n >> x;
vector<int> a(n);
for (auto &i: a)cin >> i;
a = c(a);
vector<int> p(n), s(n);
segtree pt, st;
pt.init(n+3), st.init(n+3);
rep(i, 0, n) {
p[i] = pt.get(0, a[i])+1;
pt.upd(a[i], p[i]);
}
rep(i, 1, n)p[i] = max(p[i-1], p[i]);
//rep(i, 0, n)
//cout << p[i] << " ";
//cout << nl;
// 8 9 10 2 3 10
int res = p[n-1];
for (int i = n-1; i >= 1; --i) {
s[i] = st.get(a[i]+1, n+2)+1;
res = max(res, p[i-1]+s[i]);
//if (i == n-3)cout << p[i-1] << endl;
//if (p[i-1]+s[i] == 6)cout << i+1 << " " << p[i-1] << " " << s[i] << nl;
st.upd(a[i], s[i]);
}
cout << res << nl;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
