#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
    int n,k;cin>>n>>k;
    vector<int> A(n);
    for(int i = 0; n > i; i++){
        cin>>A[i];
    }
    sort(A.begin(),A.end());
    A.erase(unique(A.begin(),A.end()),A.end());
    cout << A.size() << " " << (A.size()==1 && n==k ? 1 : 0) << endl;
}