求钓ce

#include <iostream>
#define int long long int
using namespace std;
int a[114514], _, n, maxn = 0, minn = 0;

template <typename _Tp>
inline const _Tp &
__max(const _Tp &__a, const _Tp &__b)
{
    __glibcxx_function_requires(_LessThanComparableConcept<_Tp>) 
    if (__a < __b) return __b;
    return __a;
}

template <typename _Tp>
inline const _Tp &
__min(const _Tp &__a, const _Tp &__b)
{
    __glibcxx_function_requires(_LessThanComparableConcept<_Tp>)
     if (__b < __a) return __b;
    return __a;
}
int main()
{
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> _ >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        maxn = __max(maxn, __max(_ + 1 - a[i], a[i]));
        minn = __max(minn, __min(_ + 1 - a[i], a[i]));
    }
    cout << minn << " " << maxn;
    return 0;
}