#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)

int main(){
    int n,m;
    cin >> n >> m;
    vector<int> a(n);
    rep(i,n) cin >> a[i];
    sort(a.begin(),a.end());
    a.erase(unique(a.begin(),a.end()),a.end());
    int MAX = a.size();
    if (n == 1 && m == 1){
        cout << "1 1" << endl;
        return 0;
    }
    else if (n == m){
        if (MAX == 1){
            cout << MAX << " " << 1 << endl;
            return 0;
        }
        else{
            cout << MAX << " " << 0 << endl;
            return 0;
        }
    }
    else{
        cout << MAX << " " << 0 << endl;
        return 0;
    }
    


 

    return 0;
}