#include<algorithm>
using namespace std;
#include<bitset>

bitset <1000000005> b;
int n,m,k,a[100];

int main ()
{
    freopen("pod.in","r",stdin);
    freopen("pod.out","w",stdout);
    int i;
    scanf("%d%d%d",&n,&m,&k);
    for(i=1;i<=m;++i)
        scanf("%d",&a[i]);
    sort(1+a,1+a+m);
    for(i=1;i<=n;++i);
    return 0;
}