#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using ull = unsigned long long;
long long modinv(long long a, long long m) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}
long long mod = 1000000007;
int main() {
  long long N,M; cin >> N >> M;
  vector<int> A(M + 1);
  for(int i = 0; i < N; i++) {
    int a; cin >> a;
    A[a]++;
  }
  for(int i = 1; i <= M; i++) {
    cout << i << " " << A[i] << endl;
  }
}