#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define sz(x) int(v.size())
typedef long long ll;
typedef pair<int,int> P;
const int inf=1000000007;
const int mod=1e9 + 7;
const double PI=3.14159265358979323846;
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};

int cans(bool f){
    if(f) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
}


int main() {
    int N,M;
    cin >> N >> M;
    set<int> s; 
    int unicnt = 0;
    int all = 0;
    int ans = 1;
    rep(i,N) {
	int a;
	cin >> a;
	if(i == 0) all = a;
	if(all != a) ans= 0;
	if(s.find(a) == s.end()) {
	    s.insert(a);
	    unicnt++;
	}	
    }
    if(ans ==1) {
	if(M >= N+1) ans = 0;
    }
    cout << unicnt << " " <<  ans<<  endl;
}