#pragma ide diagnostic ignored "misc-no-recursion"

#include "bits/stdc++.h"

using namespace std;
typedef long long ll;
typedef double db;

#define TESTCASE 0
#define LOCAL_INTERACTOR 0

static constexpr int INF = 1e9;

static ll find_min(int N, const vector<ll> &A) {
    ll l = 1, r = 1e10;
    while (r - l > 1) {
        ll m = (l + r) / 2;

        bool ok = true;
        ll x = 0;
        for (int i = 0; i < N; i++) {
            if (x > A[i]) ok = false;
            x = max(x + m, A[i] + 1);
        }

        if (ok) {
            l = m;
        } else {
            r = m;
        }
    }
    return l;
}

static vector<ll> find_max(int N, const vector<ll> &A, ll mi) {
    vector<pair<ll, ll>> I(N + 1);
    auto check = [&](ll ma) {
        I[0] = {mi, ma};
        for (int i = 0; i < N; i++) {
            I[i].first = max(I[i].first, A[i] + 1);
            I[i].second = min(I[i].second, A[i + 1]);
            if (I[i].first > I[i].second) return false;

            I[i + 1] = {I[i].first + mi, I[i].second + ma};
        }
        if (I[N - 1].second < A[N]) return false;
        return true;
    };

    ll l = mi, r = 1e10;
    while (r - l > 1) {
        ll ma = (l + r) / 2;
        if (!check(ma)) {
            l = ma;
        } else {
            r = ma;
        }
    }

    assert(check(l + 1));

    vector<ll> res(N + 1);
    for (ll i = N - 1, x = 1e10; i >= 0; i--) {
        x = min(x - mi, I[i].second);
        res[i + 1] = x;
    }
    return res;
}

static void solve([[maybe_unused]] int tc) {
    ll L;
    int N;
    cin >> L >> N;

    vector<ll> A(N + 1);
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }
    A[N] = L;

    ll mi = find_min(N, A);
    auto res = find_max(N, A, mi);

    for (int i = 0; i < N; i++) {
        cout << res[i] << ' ' << res[i + 1] << '\n';
    }
}

int main() {
    ios::sync_with_stdio(false);

    if (const char *f = getenv("REDIRECT_STDOUT"); f) {
        freopen(f, "w", stdout);
    }

    int T = 1;
#if TESTCASE
    cin >> T;
#endif

    for (int t = 1; t <= T; t++) {
        solve(t);
    }

    return 0;
}