#include
     
      #include
      
       #include
       
        #include
        
         #include
         
          #include
          
           #include
           
            using namespace std;const int N=100010;int isin[N],dfn[N],low[N],bel[N];vector
            
             g[N];int bnt,cnt;stack
             
              s;int n,m;void dfs(int i){ dfn[i]=low[i]=++cnt; isin[i]=1; s.push(i); int j; for(j=0;j
              
               0) printf("%d\n",tongji[ret]); else printf("0\n"); return 0;}