dfs(qz,qy);
bool dfs(int u,int father){
    stt.push_back(u);
        if(u==qy) {
            cout<<ans<<" "<<stt.size()<<endl;
            for(auto k : stt) cout<<k<<" ";
            cout<<endl;
            return true;    
        }
        vs[u]=true;
    for(int i=head[u];i!=-1;i=ed[i].nx){
        int j=ed[i].to;
        if(vs[j]||j==father) continue;
        if(dfs(j,u))//深搜
        return true;
    }
     stt.pop_back();
    return false;
}