#include <cstdio>
#include <vector>
#include <algorithm>
#include <numeric>

typedef long long ll;

using namespace std;

int main()
{
    ll i, ans, N, K;

    scanf("%lld %lld", &N, &K);

    vector<ll> hand(K);

    for(i = 0; i < K; i++)
        scanf("%lld", &hand[i]);

    vector<ll> table, points;

    for(i = 0; i < K; i++)
    {
        vector<ll>::iterator it = upper_bound(table.begin(), table.end(), hand[i]);

        if(it == table.end())
        {
            table.push_back(hand[i]);
            points.push_back(0);
        }
        else
            points[it - table.begin()] = 1;
    }

    ans = accumulate(points.begin(), points.end(), 0);

    printf("%lld\n", ans);

    return 0;
}