#include <bits/stdc++.h>
using namespace std;
using ll = long long;


int main() {
    ll N,M,A,minA=0;
    set<ll> uniA={};
    cin >> N >> M;
    for (int i=0;i<N;i++){
        cin >> A;
        if (A <= M){
            uniA.insert(A);
        }
    }
    if (uniA.size()==1 & N==M){
        minA = 1;
    }
    cout << uniA.size() << ' ' << minA;
}