#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
template <typename T, typename TT>
inline ostream &operator<<(ostream &os, const pair<T, TT> &t) {
  return os << t.first << " " << t.second;
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &t) {
  for (auto i : t) os << i << " ";
  return os;
}
template <typename T>
inline istream &operator>>(istream &is, vector<T> &v) {
  for (T &t : v) is >> t;
  return is;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &is, pair<T1, T2> &t) {
  is >> t.first >> t.second;
  return is;
}
const long long mod = 1e9 + 7;
void solve() {
  long long n, m;
  cin >> n >> m;
  string ans;
  multiset<long long> s;
  for (int i = 0; i < n; i++) s.insert(0);
  vector<long long> v(n + 1);
  long long c = 1;
  for (int i = 0; i < m; i++) {
    int x;
    cin >> x;
    s.erase(s.find(v[x]));
    v[x]++;
    s.insert(v[x]);
    if (*s.begin() < c)
      ans += '0';
    else
      ans += '1', c++;
  }
  cout << ans << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  ;
  int T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
