#include <bits/stdc++.h>
bool local = false;
using namespace std;
template <class T>
string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
template <class T>
void print(T v) {
  cout << ((int)(v).size()) << "\n";
  for (auto x : v) cout << x << ' ';
  cout << "\n";
};
template <class T>
void print1(T v) {
  cout << ((int)(v).size()) << "\n";
  for (auto x : v) cout << x + 1 << ' ';
  cout << "\n";
};
template <class T1, class T2>
ostream &operator<<(ostream &o, pair<T1, T2> x) {
  return o << x.first << ' ' << x.second;
}
template <class T1, class T2>
istream &operator>>(istream &o, pair<T1, T2> &x) {
  return o >> x.first >> x.second;
}
template <class T1, class T2>
pair<T1, T2> operator+(pair<T1, T2> a, pair<T1, T2> b) {
  a.first += b.first;
  a.second += b.second;
  return a;
}
template <class T1, class T2>
pair<T1, T2> operator-(pair<T1, T2> a, pair<T1, T2> b) {
  a.first -= b.first;
  a.second -= b.second;
  return a;
}
template <class T1, class T2>
void operator+=(pair<T1, T2> &a, pair<T1, T2> b) {
  a.first += b.first;
  a.second += b.second;
}
template <class T1, class T2>
void operator-=(pair<T1, T2> &a, pair<T1, T2> b) {
  a.first -= b.first;
  a.second -= b.second;
}
int nint() {
  int x;
  cin >> x;
  return x;
}
double getTime() { return clock() / (double)CLOCKS_PER_SEC; };
mt19937 rnd(0);
int rand(int n) { return rnd() % n; }
int rand(int l, int r) { return rnd() % (r - l + 1) + l; }
const int mod = 1000000000 + 7;
void initIO() {
  if (local) {
    freopen("input.txt", "r", stdin);
    srand((int)time(0));
    rnd.seed((int)time(0));
  } else {
    {
      ios::sync_with_stdio(0);
      cin.tie(0);
      cout.tie(0);
    };
  }
}
void solve();
signed main() {
  initIO();
  int tc = 1;
  for (int tt = 0; tt < (tc); tt++) {
    solve();
  }
  if (local)
    cout << "\n"
         << "time = " << getTime() << "\n";
}
int n;
int m;
int s[700500];
int findsum(int l, int r) {
  l++;
  r++;
  int sum = 0;
  int x = r;
  while (x > 0) {
    sum += s[x];
    x &= x - 1;
  }
  x = l - 1;
  while (x > 0) {
    sum -= s[x];
    x &= x - 1;
  }
  return sum;
}
void modify(int x, int val) {
  x++;
  while (x <= n + m + 1) {
    s[x] += val;
    x |= x - 1;
    x++;
  }
}
int mi[300500], ma[300500];
int last[300500];
int get(int x) { return findsum(last[x] + 1, n + m - 1); }
void add(int x, int t) {
  if (last[x] != -1) modify(last[x], -1);
  last[x] = t;
  modify(last[x], 1);
}
void solve() {
  memset(last, -1, sizeof(last));
  cin >> n >> m;
  for (int i = 0; i < (n); i++) add(n - i - 1, i);
  for (int i = 0; i < (n); i++) mi[i] = ma[i] = i;
  for (int j = 0; j < (m); j++) {
    int x;
    cin >> x;
    x--;
    ma[x] = max(ma[x], get(x));
    add(x, j + n);
    mi[x] = 0;
  }
  for (int i = 0; i < (n); i++) ma[i] = max(ma[i], get(i));
  for (int i = 0; i < (n); i++) cout << mi[i] + 1 << ' ' << ma[i] + 1 << "\n";
}
