#include<iostream>
#include<algorithm>
using namespace std;
enum limits
{
    maxn = 500'000
};
int n, c, b;
bool isb[maxn + 7];
char sta[maxn + 7];
int main()
{
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> c >> b;
    fill_n(sta+1, n, '0');
    sta[n+1] = '\n', sta[n+2] = '\0';
    for(int i=1; i<=b; i++)
    {
        int t;
        cin >> t;
        isb[t] = true;
    }
    int cnt = 0;
    if(c & 1)
        cnt = 1, sta[1] = '1';
    int p = cnt ? 3 : 2;
    while(cnt < c)
    {
        while(isb[p])
            p++;
        sta[p] = '1', cnt += 2, p += 2;
    }
    cout << (sta + 1);
}