#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    int x, n, count_left = 0, count_right = 0;
    cin >> x >> n;
    int food[n];
    for (int i = 0; i < n; i++) cin >> food[i];
    sort(food, food + n);

    for (int i = 0; i < n; i++) {
        if (food[i] < x) count_left++;
        if (food[i] > x) count_right++;
    }

    if (count_left > count_right) cout << count_left << " " << food[0];
    else cout << count_right << " " << food[n - 1];

    return 0;
}