#ifdef ONPC
//#define _GLIBCXX_DEBUG
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define allit(a) (a).begin(), (a).end()
#define memclr(a) memset(a, 0, sizeof(0))
#define sz(a) ((int) (a).size())
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
using vii = vector<pair<int, int>>;
using vvi = vector<vector<int>>;
template<typename T>
using uset = unordered_set<T>;
template<typename K, typename V>
using umap = unordered_map<K, V>;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/detail/standard_policies.hpp>
//namespace pd = __gnu_pbds;
//template<typename K>
//using ordered_set = pd::tree<
// K,
// pd::null_type,
// less<int>,
// pd::rb_tree_tag,
// pd::tree_order_statistics_node_update>;
//using pd::gp_hash_table;
void debug_out() {
cerr << endl;
}
template<typename... Tail>
void debug_out(vector<int> h, Tail... t) {
cerr << "[";
for (int i = 0; i < sz(h); i++) {
if (i != 0) cerr << ", ";
cerr << h[i];
}
cerr << "]";
debug_out(t...);
}
template<typename P1, typename P2, typename... Tail>
void debug_out(pair<P1, P2> h, Tail... t) {
cerr << "[" << h.first << ", " << h.second << "]";
debug_out(t...);
}
template<typename Head, typename... Tail>
void debug_out(Head h, Tail... t) {
cerr << "[" << h << "]";
debug_out(t...);
}
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
struct chash {
int operator() (int x) const { return x ^ RANDOM; }
};
const int INF = 1e9+1;
const ll INFL = 1e18+1;
const int N = 1e5;
int solve();
signed main() {
cin.tie(0)->sync_with_stdio(0);
int t = 1;
//cin >> t;
while (t-- && cin) {
if (solve()) break;
#ifdef ONPC
cout << "____________________" << endl;
#endif
}
return 0;
}
int lis(vi& a) {
int res = 0;
vi dp(a.size());
vi b(a.size(), INF);
for (int i = 0; i < sz(a); i++) {
dp[i] = 1;
int l = -1, r = sz(a);
while (l < r - 1) {
int mid = (l + r) / 2;
if (b[mid] >= a[i]) r = mid;
else l = mid;
}
res = max(res, r);
b[r] = a[i];
}
return res+1;
}
int solve() {
int n, x; cin >> n >> x;
vi a(n);
for (auto& i : a) cin >> i;
cout << lis(a);
return 0;
}
