#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main(int argc, char const *argv[]) {
  int n, m;
  cin >> n >> m;
  int a[m];
  int oks[n + 1];
  for (int i = 0; i < n + 1; i++) oks[i] = 1;
  for (int i = 0; i < m; i++) {
    int a;
    cin >> a;
    oks[a] = 0;
  }
  long long dp[n + 1];
  for (int i = 0; i <= n; i++) dp[i] = 0;
  dp[0] = 1;
  for (int now = 0; now < n; ++now) {
    for (int next = now + 1; next <= min(n, now + 2); ++next) {
      if (oks[next] == 1) {
        dp[next] += dp[now];
        dp[next] %= mod;
      }
    }
  }
  for (int i = 0; i < n + 1; i++) {
    cout << i << ":" << dp[i] << endl;
  }
  return 0;
}
