/*
ID: Yoana Zelova zelova1
PROG:
LANG: C++
*/
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<fstream>
using namespace std;
long long n,k,a[5012],ok,dp[5012],i,m,br;
int main()
{
    freopen ("maximal.in","r",stdin);
    freopen ("maximal.out","w",stdout);
    cin>>n>>k;
    for(i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
    }
    ok=1;
    dp[1]=a[i];
    for(i=2;i<=n;i++)
    {
        if(a[i]>dp[ok])
        {
            ok++;
            dp[ok]=a[i];
        }
        else
        {
            m=lower_bound(dp+1,dp+ok+1,a[i])-dp;
            dp[m]=a[i];
        }
    }
    n=lower_bound(a+1,a+n+1,k)-a;
    br=1;
    for(i=1;i<=n;i++)
    {
        if(a[i]<k)br++;
    }
    cout<<ok<<" "<<br<<endl;
    return 0;
}