#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>

typedef long long int ll;
using namespace std;
#define INF 1234567890

const int LIMIT = 1e+9;
int n, h;
int even_h[500005];
int odd_h[500005];
int res[500005];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	cin >> n >> h;
	int N = n / 2;
	for (int i = 0; i < N; i++) {
		int even, odd;
		cin >> even >> odd;
		even_h[even]++;
		odd_h[odd]++;
	}
	for (int i = h; i >= 0; i--) {
		even_h[i] += even_h[i + 1];
		odd_h[i] += odd_h[i + 1];
	}
	int min_v = INF;
	int min_cnt = 0;
	for (int i = 1; i <= h; i++) {
		res[i] = even_h[i] + odd_h[h - i + 1];
		min_v = min(min_v, res[i]);
	}
	for (int i = 1; i <= h; i++) {
		if (min_v == res[i]) min_cnt++;
	}
	cout << min_v << " " << min_cnt;
	return 0;
}