void dfs(int i) { k=0; int j; if(v[i]==0) v[i]++; for(j=1;j