#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll M, K; int N;
    if (!(cin >> M >> K >> N)) return 0;
    vector<ll> A(N);
    for (int i = 0; i < N; ++i) cin >> A[i];

    map<ll,ll> seg; // start-end intervallum
    seg[K] = K;
    ll curr = K, total = 0;
    int starts = 0;

    auto seen = [&](ll x)->bool{ //lambda
        auto it = seg.upper_bound(x);
        if (it == seg.begin()) return false;
        --it;
        return it->first <= x && x <= it->second;
    };

    for (ll t : A) {
        if (seen(t)) continue;
        ++starts;
        total += llabs(curr - t);

        ll L = min(curr, t), R = max(curr, t);
        auto it = seg.lower_bound(L);
        if (it != seg.begin()) {
            --it;
            if (it->second < L - 1) ++it;
        }


        // összeolvasztás
        while (it != seg.end() && it->first <= R + 1) {
            L = min(L, it->first);
            R = max(R, it->second);
            it = seg.erase(it);
        }
        seg[L] = R;
        curr = t;
    }

    cout << starts << " " << total << '\n';
    return 0;
}