#include using namespace std; static bool broken[1<<20]; int n; string res; void dfs(int i,int c){ if (c<0){ return; } if (i==n){ if (c==0){cout<>n>>c>>b; while (b--) {int x; cin>>x; broken[x-1]=true;} for (int i=0; i