#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 1010
using namespace std;
bool vis[N];
int n,m,s1,s2,tot,tim,sum,top,ans1,ans2;
int in[N],out[N],low[N],dfn[N],head[N],stack[N],belong[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
struct Edge
{int to,next;
}edge[N];
int add(int x,int y)
{tot++;edge[tot].to=y;edge[tot].next=head[x];head[x]=tot;
}
int tarjan(int x)
{dfn[x]=low[x]=++tim;stack[++top]=x,vis[x]=true;for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;if(vis[t]) low[x]=min(low[x],dfn[t]);else if(!dfn[t]) tarjan(t),low[x]=min(low[x],low[t]);}if(low[x]==dfn[x]){sum++;belong[x]=sum;for(;stack[top]!=x;top--){vis[stack[top]]=false;belong[stack[top]]=sum;}top--,vis[x]=false;}
}
int shink_point()
{for(int i=1;i<=n;i++)for(int j=head[i];j;j=edge[j].next){int t=edge[j].to;if(belong[i]!=belong[t])in[belong[t]]++,out[belong[i]]++;}
}
int main()
{n=read();for(int i=1;i<=n;i++){while(1){m=read();if(m==0) break;add(i,m);}}for(int i=1;i<=n;i++)if(!dfn[i]) tarjan(i);shink_point();for(int i=1;i<=sum;i++){if(in[i]==0) s1++;if(out[i]==0) s2++;} if(sum==1) ans2=0;else ans2=max(s1,s2);ans1=s1;printf("%d\n%d",ans1,ans2);return 0;
}

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 5005
using namespace std;
bool vis[N];
long long  n,m,x,y,ans,tot=1,tim,sum,top;
long long du[N],dfn[N],low[N],stack[N],belong[N];
long long head[20010];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}while(ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=getchar();}return x*f;
}
struct Edge
{int from,next,to;
}edge[20010];
void add(int x,int y)
{tot++;edge[tot].to=y;edge[tot].next=head[x];head[x]=tot;
}
int tarjan(int now,int pre)
{dfn[now]=low[now]=++tim;stack[++top]=now; for(int i=head[now];i;i=edge[i].next){int t=edge[i].to;if(i==(1^pre)) continue;if(!dfn[t]) tarjan(t,i),low[now]=min(low[now],low[t]);else low[now]=min(low[now],dfn[t]);}if(low[now]==dfn[now]){sum++; belong[now]=sum;for(;stack[top]!=now;top--)belong[stack[top]]=sum;top--;}
}
int main()
{n=read(),m=read();for(int i=1;i<=m;i++)x=read(),y=read(),add(x,y),add(y,x);tarjan(1,0);for(int i=1;i<=n;i++)for(int j=head[i];j;j=edge[j].next)if(belong[i]!=belong[edge[j].to]) du[belong[i]]++,du[belong[edge[j].to]]++;for(int i=1;i<=n;i++)if(du[i]==2) ans++;printf("%d",(ans+1)>>1);return 0;
}

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 10010
using namespace std;
bool vis[N];
int n,m,x,y,tot,tim,sum,top;
int s[N],dfn[N],low[N],head[N],stack[N],belong[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
struct Edge
{int to,next;
}edge[N];
int add(int x,int y)
{tot++;edge[tot].to=y;edge[tot].next=head[x];head[x]=tot;
}
int tarjan(int x)
{dfn[x]=low[x]=++tim;stack[++top]=x;vis[x]=true;for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;if(vis[t]) low[x]=min(low[x],dfn[t]);else if(!dfn[t]) tarjan(t),low[x]=min(low[x],low[t]);}if(low[x]==dfn[x]){sum++;belong[x]=sum,s[sum]++;for(;stack[top]!=x;top--){s[sum]++;vis[stack[top]]=false;belong[stack[top]]=sum;}vis[x]=false;top--;}
}
int main()
{freopen("messagez.in","r",stdin);freopen("messagez.out","w",stdout);n=read(),m=read();for(int i=1;i<=m;i++){x=read(),y=read();add(x,y);}for(int i=1;i<=n;i++)if(!dfn[i]) tarjan(i);for(int i=1;i<=n;i++)if(s[belong[i]]==1) printf("F\n");else printf("T\n");return 0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 500010
#define ll long long
using namespace std;
ll ans[N];
int n,m,x,y,tot,tim;
int dfn[N],low[N],head[N],size[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
struct Edge
{int to,next;
}edge[N<<1];
int add(int x,int y)
{tot++;edge[tot].to=y;edge[tot].next=head[x];head[x]=tot;
}
int tarjan(int x)
{int z=0;size[x]=1;dfn[x]=low[x]=++tim;for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;if(!dfn[t]){tarjan(t);size[x]+=size[t];low[x]=min(low[x],low[t]);if(dfn[x]<=low[t]){ans[x]+=(ll)z*size[t];z+=size[t];}}else low[x]=min(low[x],dfn[t]);}ans[x]+=(ll)z*(n-z-1);
}
int main()
{n=read(),m=read();for(int i=1;i<=m;i++){x=read(),y=read();add(x,y),add(y,x);}tarjan(1);for(int i=1;i<=n;i++)printf("%lld\n",(ans[i]+n-1)<<1);return 0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 510
using namespace std;
long long ans2;
bool vis[N],cut_point[N],cut_edge[N];
int head[N<<1],dfn[N],low[N],belong[N];
int n,m,x,y,s,tim,cut,tot,sum,cnt,ans1;
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
struct Edge
{int to,next;
}edge[N<<1];
int add(int x,int y)
{tot++;edge[tot].to=y;edge[tot].next=head[x];head[x]=tot;
}
int tarjan(int x,int pre)
{int sum=0;bool boo=false;dfn[x]=low[x]=++tim;for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;if((1^i)==pre) continue;if(!dfn[t]){sum++;tarjan(t,i);low[x]=min(low[x],low[t]);if(low[t]>dfn[x]) cut_edge[i/2]=true;if(low[t]>=dfn[x]) boo=true;    }else low[x]=min(low[x],dfn[t]);    }    if(pre==-1){if(sum>1) cut_point[x]=true;}else if(boo) cut_point[x]=true;
}
int begin()
{n=tim=ans1=0;tot=ans2=1;for(int i=1;i<=N;i++){vis[i]=cut_point[i]=0;dfn[i]=low[i]=belong[i]=0;} memset(head,0,sizeof(head));memset(edge,0,sizeof(edge));
}
int dfs(int x)
{s++;vis[x]=true;belong[x]=sum;for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;if(cut_point[t]&&belong[t]!=sum)  cut++,belong[t]=sum;if(!vis[t]&&!cut_point[t]) dfs(t);}
}
int main()
{while(1){m=read();if(m==0) break;begin();for(int i=1;i<=m;i++){x=read(),y=read();add(x,y),add(y,x);n=max(n,max(x,y));}for(int i=1;i<=n;i++)if(!dfn[i]) tarjan(i,-1);sum=0;for(int i=1;i<=n;i++){if(vis[i]||cut_point[i]) continue;s=cut=0,sum++;dfs(i);if(!cut) ans1+=2,ans2*=(long long)(s*(s-1))>>1;if(cut==1) ans1++,ans2*=(long long)s;}printf("Case %d: %d %lld\n",++cnt,ans1,ans2);}return 0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 10010
using namespace std;
int n,x,y,tot,tim,cnt,sum;
int dfn[N],low[N],head[N];
bool flag,vis[N],cut_point[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
struct Edge
{int from,next,to;
}edge[N*200];
void add(int x,int y)
{tot++;edge[tot].to=y;edge[tot].next=head[x];head[x]=tot;
}
int begin()
{tim=0,tot=1;flag=false;memset(head,0,sizeof(head));memset(dfn,0,sizeof(dfn));memset(low,0,sizeof(low));memset(cut_point,0,sizeof(cut_point));
}
int tarjan(int x,int pre)
{int s=0; bool boo=false;dfn[x]=low[x]=++tim;for(int i=head[x];i;i=edge[i].next){if((i^1)==pre) continue;int t=edge[i].to;if(!dfn[t]){s++,tarjan(t,i);low[x]=min(low[t],low[x]);if(dfn[x]<=low[t]) boo=true;}else low[x]=min(low[x],dfn[t]);}if(pre==-1){if(s>1) cut_point[x]=true;}else if(boo) cut_point[x]=true;
}
int main()
{while(1){x=read();if(x==0) break;begin();y=read(),add(x,y),add(y,x);n=max(n,max(x,y)),cnt++;while(1){x=read();if(x==0) break;y=read(),add(x,y),add(y,x);n=max(n,max(x,y));}printf("Network #%d\n",cnt);tarjan(1,-1);for(int i=1;i<=n;i++)if(cut_point[i]){sum=0;flag=true;memset(vis,0,sizeof(vis));for(int j=head[i];j;j=edge[j].next){int t=edge[j].to;if(vis[low[t]]) continue;vis[low[t]]=true,sum++;}printf("  SPF node %d leaves %d subnets\n",i,sum);}if(!flag) printf("  No SPF nodes\n");printf("\n");}return 0;
}

#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 1010
using namespace std;
double ans;
int n,k,x,y,s,fx,fy,sum,fa[N],xx[N],yy[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
struct Edge
{int x,y;double z;
}edge[N*N];
int cmp(Edge a,Edge b)
{return a.z<b.z;}
int find(int x)
{if(x==fa[x]) return  x;fa[x]=find(fa[x]);return fa[x];
}
int main()
{n=read(),k=read();for(int i=1;i<=n;i++) xx[i]=read(),yy[i]=read();for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(i!=j){++s;edge[s].x=i;edge[s].y=j;edge[s].z=sqrt((double)pow(xx[i]-xx[j],2)+(double)pow(yy[i]-yy[j],2));}for(int i=1;i<=n;i++) fa[i]=i;sort(edge+1,edge+1+s,cmp);for(int i=1;i<=s;i++){x=edge[i].x,y=edge[i].y;fx=find(x),fy=find(y);if(fa[fx]==fy) continue;fa[fx]=fy;sum++;if(sum==n-k+1) {ans=edge[i].z;break;}}printf("%.2lf",ans);return 0;
}

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define N 210000
using namespace std;
int n,m,x,y,k,z1,z2,fx,fy,sum,ans,fa[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();return x*f;
}
struct Edge
{int x,y,z1,z2;
}edge[N];
int cmp1(Edge a,Edge b)
{return a.z1<b.z1;}
int cmp2(Edge a,Edge b)
{return a.z2<b.z2;}
int find(int x)
{if(x==fa[x]) return  x;fa[x]=find(fa[x]);return fa[x];
}
int main()
{freopen("hzoi_road2.in","r",stdin);freopen("hzoi_road2.out","w",stdout);n=read(),k=read(),m=read();for(int i=1;i<m;i++){x=read(),y=read(),z1=read(),z2=read();edge[i].x=x;edge[i].y=y;edge[i].z1=z1;edge[i].z2=z2;}for(int i=1;i<=n;i++) fa[i]=i;sort(edge+1,edge+m+1,cmp1);for(int i=1;i<=m;i++){if(k==0) break;x=edge[i].x,y=edge[i].y;fx=find(x),fy=find(y);fa[fx]=fy;sum++;ans=max(ans,edge[i].z1);if(sum==k)break;}sort(edge+1,edge+1+m,cmp2);for(int i=1;i<=m;i++){x=edge[i].x,y=edge[i].y;fx=find(x),fy=find(y);if(fx==fy) continue;fa[fx]=fy;ans=max(ans,edge[i].z2);}printf("%d",ans);return 0;
}

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 300010
#define maxn 0x7fffffff
using namespace std;
bool vis[N];
long long ans;
int n,m,x,y,z,s,tot,num,sum,top,tim;
int fa[N],low[N],dfn[N],cost[N],stack[N],head[N],belong[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1; ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}return x*f;
}
struct Edge
{int to,dis,next;
}edge[N];
struct Edde
{int to,dis,next;
}edde[N];
int add(int x,int y,int z)
{tot++;edge[tot].to=y;edge[tot].dis=z;edge[tot].next=head[x];head[x]=tot;
}
void begin()
{s=0,tim=0,sum=0,tot=0;memset(dfn,0,sizeof(dfn));memset(low,0,sizeof(low));memset(vis,0,sizeof(vis));memset(head,0,sizeof(head));memset(belong,0,sizeof(belong));
}
void tarjan(int now)
{dfn[now]=low[now]=++tim;stack[++top]=now; vis[now]=true;for(int i=head[now];i;i=edge[i].next){int t=edge[i].to;if(vis[t]) low[now]=min(low[now],dfn[t]);else if(!dfn[t]) tarjan(t),low[now]=min(low[now],low[t]);}if(low[now]==dfn[now]){sum++;belong[now]=sum;for(;stack[top]!=now;top--){int x=stack[top];belong[x]=sum;vis[x]=false;}vis[now]=false;top--;}
}
void work()
{ans=0;for(int i=1;i<=n;i++)for(int j=head[i];j;j=edge[j].next){int t=edge[j].to;if(belong[i]!=belong[t])cost[belong[t]]=min(cost[belong[t]],edge[j].dis);    } for(int i=1;i<=sum;i++)if(cost[i]!=maxn) ans+=(long long)cost[i];printf("%lld\n",ans);
}
int main()
{while(scanf("%d%d",&n,&m)!=EOF){begin();for(int i=1;i<=n;i++) cost[i]=maxn;for(int i=1;i<=m;i++)x=read(),y=read(),z=read(),add(x+1,y+1,z);for(int i=1;i<=n;i++)if(!dfn[i]) tarjan(i);work();}return 0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 50010
using namespace std;
int n,m,x,y,z,fx,fy,sum,fa[N],ans1,ans2;
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
struct Edge
{int x,y,z;
}edge[N<<1];
int cmp(Edge a,Edge b)
{return a.z<b.z;}
int find(int x)
{if(x==fa[x]) return x;fa[x]=find(fa[x]);return fa[x];
}
int main()
{n=read(),m=read();for(int i=1;i<=m;i++){edge[i].x=read();edge[i].y=read();edge[i].z=read();}sort(edge+1,edge+1+m,cmp);for(int i=1;i<=n;i++) fa[i]=i;for(int i=1;i<=m;i++){x=edge[i].x,y=edge[i].y;fx=find(x),fy=find(y);if(fx==fy) continue;fa[fx]=fy;sum++;ans2=max(ans2,edge[i].z);if(sum==n-1) break;}ans1=n-1;printf("%d %d",ans1,ans2);return 0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 210
#define maxn 999999
using namespace std;
double ans[N],f[N][N];
int n,m,x,y,z,dis[N][N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
int main()
{n=read(),m=read();for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)dis[i][j]=(i!=j)*maxn;for(int i=1;i<=m;i++){x=read(),y=read(),z=read();f[x][y]=f[y][x]=1;dis[x][y]=dis[y][x]=z;}for(int k=1;k<=n;k++)for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(dis[i][j]>dis[i][k]+dis[k][j]){f[i][j]=f[i][k]*f[k][j];dis[i][j]=dis[i][k]+dis[k][j];}else if(dis[i][j]==dis[i][k]+dis[k][j])f[i][j]+=f[i][k]*f[k][j];for(int k=1;k<=n;k++)for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(i!=k&&k!=j&&dis[i][j]==dis[i][k]+dis[k][j]&&f[i][j])ans[k]+=(double)f[i][k]*f[k][j]/f[i][j];for(int i=1;i<=n;i++)printf("%.3lf\n",ans[i]);return 0;
}

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#define N 300
#define maxn 9999999
using namespace std;
int n,m,x,y,z,p,dy[N],dis[N][N],f[N][N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1; ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}return x*f;
}
struct Node
{int c,num;
}node[N];
int cmp(Node a,Node b)
{return a.c<b.c;}
int main()
{n=read(),m=read(),p=read();for(int i=1;i<=n;i++) node[i].c=read(),node[i].num=i;sort(node+1,node+1+n,cmp);for(int i=1;i<=n;i++) dy[node[i].num]=i;for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)f[i][j]=dis[i][j]=maxn;for(int i=1;i<=n;i++) f[i][i]=0;for(int i=1;i<=m;i++){x=read(),y=read(),z=read();x=dy[x],y=dy[y];f[x][y]=f[y][x]=min(f[x][y],z);}for(int k=1;k<=n;k++)for(int i=1;i<=n;i++)for(int j=1;j<=n;j++){f[i][j]=min(f[i][j],f[i][k]+f[k][j]);dis[i][j]=min(dis[i][j],f[i][j]+max(max(node[i].c,node[k].c),node[j].c)); }while(p--){x=read(),y=read();x=dy[x],y=dy[y];if(dis[x][y]>=maxn) printf("-1\n");else printf("%d\n",dis[x][y]);}return 0;
}

#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 300010
#define maxn 999999
using namespace std;
queue<int>q;
bool vis[N];
long long ans;
int n,m,x,y,z,tot,tot1;
int dis[N],dis1[N],head[N],head1[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
struct Edge
{int to,dis,next;
}edge[N],edge1[N];
int add(int x,int y,int z)
{tot++;edge[tot].to=y;edge[tot].dis=z;edge[tot].next=head[x];head[x]=tot;
}
int add1(int x,int y,int z)
{tot1++;edge1[tot1].to=y;edge1[tot1].dis=z;edge1[tot1].next=head1[x];head1[x]=tot1;
}
int spfa(int s)
{for(int i=1;i<=n;i++) dis[i]=maxn,vis[i]=false;q.push(s),vis[s]=true,dis[s]=0;while(!q.empty()){x=q.front();q.pop(),vis[x]=false;for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;if(dis[t]>dis[x]+edge[i].dis){dis[t]=dis[x]+edge[i].dis;if(vis[t]) continue;q.push(t),vis[t]=false;}}}
}
int spfa1(int s)
{for(int i=1;i<=n;i++) dis1[i]=maxn,vis[i]=false;q.push(s),vis[s]=true,dis1[s]=0;while(!q.empty()){x=q.front();q.pop(),vis[x]=false;for(int i=head1[x];i;i=edge1[i].next){int t=edge1[i].to;if(dis1[t]>dis1[x]+edge1[i].dis){dis1[t]=dis1[x]+edge1[i].dis;if(vis[t]) continue;q.push(t),vis[t]=false;}}}
}
int main()
{n=read(),m=read();for(int i=1;i<=m;i++){x=read(),y=read(),z=read();add(x,y,z),add1(y,x,z);}spfa(1),spfa1(1);for(int i=2;i<=n;i++)ans+=(long long)dis[i]+dis1[i];printf("%lld",ans);return 0;
}

#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 3010
#define maxn 999999
using namespace std;
queue<int>q;
bool vis[N];
int n,m,x,y,z,tot,sum[N],dis[N],f[N][N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
int spfa(int s)
{for(int i=1;i<=n;i++) dis[i]=maxn,vis[i]=false,sum[i]=1;dis[s]=0,vis[s]=true,q.push(s);while(!q.empty()){x=q.front(),q.pop();vis[x]=false;for(int t=1;t<=n;t++)if(f[x][t])if(dis[t]>dis[x]+f[x][t]){dis[t]=dis[x]+f[x][t];sum[t]=sum[x];if(vis[t]) continue;q.push(t),vis[t]=true;}else if(dis[t]==dis[x]+f[x][t]) sum[t]+=sum[x];}
}
int main()
{n=read(),m=read();for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)f[i][j]=maxn;for(int i=1;i<=m;i++){x=read(),y=read(),z=read();f[x][y]=min(f[x][y],z);}spfa(1);if(dis[n]==maxn) printf("No answer");else printf("%d %d",dis[n],sum[n]);return 0;
}

#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 300
using namespace std;
queue<int>q;
bool vis[N];
int n,m,x,y,e,tot,ans,maxn,sum;
int a[N],fa[N],pre[N],dis[N],head[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
struct Edge
{int to,dis,next;
}edge[N];
int add(int x,int y)
{tot++;edge[tot].to=y;edge[tot].next=head[x];head[x]=tot;
}
int spfa(int s)
{for(int i=1;i<=n;i++) dis[i]=0,vis[i]=false;q.push(s),vis[s]=true,dis[s]=a[s];while(!q.empty()){x=q.front();q.pop(),vis[x]=false;for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;if(dis[t]<=dis[x]+a[t]){dis[t]=dis[x]+a[t];fa[t]=x;if(vis[t]) continue;q.push(t),vis[t]=true;}}}
}
int main()
{n=read();for(int i=1;i<=n;i++) a[i]=read();for(x=1;x<n;x++){for(int y=x+1;y<=n;y++){e=read();if(e) add(x,y);}}for(int s=1;s<=n;s++){maxn=ans;memset(fa,-1,sizeof(fa));spfa(s);for(int i=1;i<=n;i++) if(ans<dis[i]) e=i,ans=dis[i];if(ans==maxn) continue;sum=0;for(;e!=-1;e=fa[e])pre[++sum]=e;}for(int i=sum;i>=1;i--)printf("%d ",pre[i]);printf("\n%d",ans);return 0;
}

#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 200100
using namespace std;
queue<int>q;
bool vis[N],vist[N];
int n,m,s,e,x,y,tot,dis[N],head[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9') ch=getchar();while(ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}return x*f;
}
struct Edge
{int to,next;
}edge[N];
int add(int x,int y)
{tot++;edge[tot].to=y;edge[tot].next=head[x];head[x]=tot;
}
int spfa(int s)
{memset(vis,0,sizeof(vis));memset(dis,0x3f3f3f3f,sizeof(dis));dis[s]=0,vis[s]=true;q.push(s);while(!q.empty()){int x=q.front(); q.pop(); vis[x]=false;for(int i=head[x];i;i=edge[i].next){int to=edge[i].to;if(dis[to]<=dis[x]+1||vist[to]) continue;dis[to]=dis[x]+1;if(vis[to]) continue;q.push(to);    vis[to]=true;}}
}
int bfs(int s)
{vis[s]=true;q.push(s);while(!q.empty()){int x=q.front(); q.pop();for(int i=head[x];i;i=edge[i].next){int to=edge[i].to;if(!vis[to]) q.push(to),vis[to]=true;}}
}
int main()
{n=read(),m=read();for(int i=1;i<=m;i++)x=read(),y=read(),add(y,x);s=read(),e=read();bfs(e);for(int i=1;i<=n;i++)if(vis[i]==false)for(int j=head[i];j;j=edge[j].next)vist[edge[j].to]=true;for(int i=1;i<=n;i++)if(!vis[i]) vist[i]=true;spfa(e);if(dis[s]>=0x3f3f3f3f) printf("-1");else printf("%d",dis[s]);return 0;
}

#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 5100
using namespace std;
queue<int>q;
bool vis[N];
int n,m,x,y,z,tot=1,ans1,ans2,sum;
int fa[N],dis[N],head[N],node[N],num[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9') ch=getchar();while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
struct Edge
{int to,dis,next,from;
}edge[N<<1];
int add(int x,int y,int z)
{tot++;edge[tot].to=y;edge[tot].dis=z;edge[tot].next=head[x];head[x]=tot;
}
int spfa(int s)
{memset(vis,0,sizeof(vis));memset(dis,0x3f3f3f3f,sizeof(dis));vis[s]=true,q.push(s),dis[s]=0;while(!q.empty()){int x=q.front();q.pop();vis[x]=false;for(int i=head[x];i;i=edge[i].next){int to=edge[i].to;if(dis[to]>dis[x]+edge[i].dis){dis[to]=dis[x]+edge[i].dis;fa[to]=x;num[to]=i;if(vis[to]) continue;q.push(to),vis[to]=true;}}}
}
int main()
{n=read(),m=read();for(int i=1;i<=m;i++){x=read(),y=read(),z=read();add(x,y,z),add(y,x,z);}memset(fa,-1,sizeof(fa));spfa(1),ans1=dis[n];for(int i=n;i!=-1;i=fa[i])node[++sum]=num[i];for(int i=1;i<=sum;i++){edge[node[i]].dis*=2;edge[node[i]^1].dis*=2;spfa(1);ans2=max(ans2,dis[n]);edge[node[i]].dis/=2;edge[node[i]^1].dis/=2;}printf("%d",ans2-ans1);return  0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 210
#define maxn 0x3f3f3f3f
using namespace std;
int n,m,x,y,z,k,T,Q,t[N],dis[N][N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
int main()
{n=read(),m=read();k=1;for(int i=1;i<=n;i++) t[i]=read();for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)dis[i][j]=maxn;for(int i=1;i<=m;i++){x=read(),y=read(),z=read();dis[++x][++y]=dis[y][x]=z;}Q=read();while(Q--){x=read(),y=read(),T=read();x++,y++;while(t[k]<=T&&k<=n){for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);k++;}if(dis[x][y]>=maxn||t[x]>T||t[y]>T) printf("-1\n");else printf("%d\n",dis[x][y]);}return 0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 200010
using namespace std;
bool vis[N],vist;
int n,m,t,x,y,z,tot,head[N],dis[N];
int read()
{int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
struct Edge
{int to,dis,next;
}edge[N<<1];
int add(int x,int y,int z)
{tot++;edge[tot].to=y;edge[tot].dis=z;edge[tot].next=head[x];head[x]=tot;
}
int spfa(int x)
{vis[x]=true;for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;if(dis[t]>dis[x]+edge[i].dis){dis[t]=dis[x]+edge[i].dis;if(vis[t]||vist){vist=true;break;}spfa(t);}}vis[x]=false;
}
void begin()
{tot=vist=0;memset(dis,0,sizeof(dis));memset(head,0,sizeof(head));memset(vis,false,sizeof(vis));
}
int main()
{t=read();while(t--){begin();n=read(),m=read();for(int i=1;i<=m;i++){x=read(),y=read(),z=read();add(x,y,z);if(z>=0) add(y,x,z);} for(int i=1;i<=n;i++){spfa(i);if(vist) break;}if(vist) printf("YE5\n");else printf("N0\n");}return 0;
}

#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 200010
#define maxn 9999999
using namespace std;
queue<int>q;
bool vis[N],vist;
int n,m,w,x,y,z,tot,head[N],dis[N],in[N];
int read()
{int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
struct Edge
{int to,dis,next;
}edge[N<<1];
int add(int x,int y,int z)
{tot++;edge[tot].to=y;edge[tot].dis=z;edge[tot].next=head[x];head[x]=tot;
}
void begin()
{tot=vist=0;memset(in,0,sizeof(in));memset(dis,0,sizeof(dis));memset(vis,0,sizeof(vis));memset(head,0,sizeof(head));
}
int spfa(int s)
{while(!q.empty()) q.pop();for(int i=1;i<=n;i++) dis[i]=maxn,vis[i]=false;vis[s]=true,dis[s]=0,q.push(s);while(!q.empty()){x=q.front(),q.pop();vis[x]=false;for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;if(dis[t]>dis[x]+edge[i].dis){dis[t]=dis[x]+edge[i].dis;if(!vis[t]) in[t]++,vis[t]=true,q.push(t);if(in[t]>n) return true;}}}return false;
}
int main()
{while(1){begin();n=read(),m=read();if(n==0&&m==0) break;for(int i=1;i<=m;i++){x=read(),y=read(),z=read(),w=read();add(x,y,z),add(y,x,w);}vist=spfa(1);if(vist||dis[n]==maxn) printf("No such path\n");else  printf("%d\n",dis[n]);}return 0;
}

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define N 51000
using namespace std;
bool vis[N];
int n,m,x,y,z,tot;
int c[N],num[N],head[N];
double ans,mid,l,r,w[N],dis[N];
struct Edge
{int to,dis,from,next;
}edge[N];
int add(int x,int y,int z)
{tot++;edge[tot].to=y;edge[tot].dis=z;edge[tot].next=head[x];head[x]=tot;
}
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1; ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}return x*f;
}
int spfa(int x)
{vis[x]=true;for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;if(dis[t]>dis[x]+w[i]){dis[t]=dis[x]+w[i];if(vis[t]||spfa(t)){vis[x]=false;return true;}  }}vis[x]=false;return false;
}
int pd()
{for(int i=1;i<=n;i++)if(spfa(i)) return true;return false;
}
int main()
{n=read(),m=read();for(int i=1;i<=n;i++) c[i]=read();for(int i=1;i<=m;i++){x=read(),y=read(),z=read();add(x,y,z);}l=0,r=100005;while(r-l>0.0000001){mid=(l+r)/2;for(int i=1;i<=tot;i++){int t=edge[i].to;w[i]=(double)mid*edge[i].dis-c[t];}if(pd()){ans=mid;l=mid;}else r=mid;}printf("%.2lf",ans);return 0;
}

#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 510
using namespace std;
priority_queue<int,vector<int>,greater<int> >q;
int n,m,x,y,tot,sum,in[N],ans[N],head[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
struct Edge
{int to,dis,next;
}edge[N];
int add(int x,int y)
{tot++;edge[tot].to=y;edge[tot].next=head[x];head[x]=tot;
}
int tpsort()
{for(int i=1;i<=n;i++)if(in[i]==0) q.push(i);while(!q.empty()){x=q.top(),q.pop(),sum++,ans[sum]=x;for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;in[t]--;if(in[t]==0) q.push(t);}}
}
int main()
{while(scanf("%d%d",&n,&m)!=EOF){sum=0,tot=0;memset(in,0,sizeof(in));memset(ans,0,sizeof(ans));memset(head,0,sizeof(head));memset(edge,0,sizeof(edge));for(int i=1;i<=m;i++)x=read(),y=read(),add(x,y),in[y]++;tpsort();for(int i=1;i<sum;i++)printf("%d ",ans[i]);printf("%d\n",ans[sum]);}return 0;
}

#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 510
using namespace std;
queue<int>q;
int n,m,x,y,tot,sum,in[N],head[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
struct Edge
{int to,next;
}edge[N];
int add(int x,int y)
{tot++;edge[tot].to=y;edge[tot].next=head[x];head[x]=tot;
}
bool tpsort()
{for(int i=1;i<=n;i++) if(in[i]==0) q.push(i);while(!q.empty()){x=q.front(),q.pop(),sum++;for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;in[t]--;if(in[t]==0) q.push(t);}}    if(sum==n) return true;return false;
}
int main()
{while(1){n=read(),m=read();if(n==0&&m==0) break;tot=0,sum=0;memset(in,0,sizeof(in));memset(head,0,sizeof(head));memset(edge,0,sizeof(edge));for(int i=1;i<=m;i++)x=read(),y=read(),add(x+1,y+1),in[y+1]++;if(tpsort()) printf("YES\n");else printf("NO\n");}return  0;
}

#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 20100
#define money 888
using namespace std;
queue<int>q;
long long anss;
int n,m,x,y,s,in[N],tot,sum,head[N],ans[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1; ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}return x*f;
}
struct Edge
{int from,to,next;
}edge[N];
int add(int x,int y)
{tot++;edge[tot].to=y;edge[tot].next=head[x];head[x]=tot;
}
void begin()
{s=0,sum=0,tot=0;anss=0;memset(in,0,sizeof(in));memset(ans,0,sizeof(ans));memset(head,0,sizeof(head));memset(edge,0,sizeof(edge));
}
int tpsort()
{for(int i=1;i<=n;i++)if(in[i]==0) q.push(i),ans[i]=0;while(!q.empty()){x=q.front();q.pop(),sum++;for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;in[t]--;if(in[t]==0) ans[t]=ans[x]+1,q.push(t);}}
}
int main()
{while(scanf("%d%d",&n,&m)!=EOF){begin();for(int i=1;i<=m;i++){x=read(),y=read();add(y,x),in[x]++;}tpsort();if(sum!=n) printf("-1\n");else {for(int i=1;i<=n;i++)anss+=money+ans[i];printf("%lld\n",anss);}       }return  0;
}

#include<queue>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define N 110
using namespace std;
int a,b,n,m,s,sum,tot,head[N],in[N],inn[N],p[N];
bool v,unpd,vis[N];
queue<int>q;
char ch;
int read()//在这里我用的读入优化
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}while(ch>='0'&&ch<='9') {x=x*10+ch-'0';ch=getchar();}return f*x;
}
struct Edge
{int from,to,next;
}edge[N];
int add(int x,int y)
{tot++;edge[tot].to=y;edge[tot].next=head[x];head[x]=tot;
}//和以前的拓扑排序过程一样，只是多加了几种情况
int tp()
{unpd=false;    v=false; sum=0;//初始数值 for(int i=1;i<=26;i++)//开始找入读为一的点
     {inn[i]=in[i];//由于我们要没输入一组后就对该序列进行判断，所以我们新设一个数组inn储存in中的各点入度的值，防止我们下一次在用时，该店的入度值已不是初始值 if(!inn[i]&&vis[i])//该点的入读为0并且我们输入过该值
          {if(!v) v=true;//我们要判断有几个入读为0的点，由于如果有两个入读为0的点我们则无法判断他们的关系因为入读为0的点一定是小的，但这两个值得大小我们又无法判断 else unpd=true;//unpd用来判断无法判段的情况
              q.push(i);p[++sum]=i;} } if(q.empty()) return 1;//如果q数组为空，就说明出现了环，则是存在矛盾的情况。 while(!q.empty())//单纯的拓扑排序，但我们要在里面多加一点东西：和前面判断入读为0的方法一样，如果删除一个点以后出现了两个入度为0的边，这样我们将无法判断这两个点的大小
    {int x=q.front();v=false;q.pop();for(int i=head[x];i;i=edge[i].next){inn[edge[i].to]--;if(!inn[edge[i].to]){q.push(edge[i].to);if(!v) v=true;else unpd=true;p[++sum]=edge[i].to;} }}if(sum!=s) return 1;//说明出现了环。 if(unpd) return 2;return 0;
}
int main()
{n=read(),m=read();for(int i=1;i<=m;i++){cin>>ch,a=ch-64;if(!vis[a]) vis[a]=true,s++;//s是用来存我们输入的元素的个数，方便后面判断s值与sum值的关系（来判断是否为环） cin>>ch;//这个在输入时其实我们也可以用一个数组来表示，在这里我们由于有一个<是没有用的，所以我们直接输入就好了 cin>>ch,b=ch-64;if(!vis[b]) vis[b]=true,s++;//vis用来表示该数有值 add(a,b);//在这里我们将我们输入的字符转化成了数字，方便后面进行操作 in[b]++;//储存入读 if(tp()==1) //在这里我们必须让他等于1，因为我们在tp函数中返回的是0,1,2
        {printf("Inconsistency found after %d relations.",i);//存在矛盾 return 0;}if(sum==n&&!tp())//sum=n,说明该序列中所有的数都进行了排序，都能确定他们的位置
        {printf("Sorted sequence determined after %d relations: ",i);for(int j=1;j<=n;j++) printf("%c",p[j]+64);//在最开始的时候我竟然让他输出p[i]+64.这告诉我们要注意我们循环使用的变量i,j printf(".");return 0;}}printf("Sorted sequence cannot be determined.");//由于我们在tp函数中只有三种情况，除了前两种剩下的就是这一种了。 return 0;
}

#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 210000
using namespace std;
queue<int>q;
int n,m,x,y,s,tot,tot1,top,tim;
bool vis[N],vis1[N],vis2[N],vist1[N],vist2[N];
int xx[N],yy[N],in1[N],in2[N],head1[N],head2[N],dfn[N];
int low[N],sum[N],ans1[N],ans2[N],head[N],stack[N],belong[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
struct Edge
{int to,next;
}edge[N],edge1[N],edge2[N];
int add(int x,int y)
{tot++;edge[tot].to=y;edge[tot].next=head[x];head[x]=tot;
}
int add1(int x,int y)
{tot1++;edge1[tot1].to=y;edge1[tot1].next=head1[x];edge2[tot1].to=x;edge2[tot1].next=head2[y];head1[x]=head2[y]=tot1;
}
int tarjan(int x)
{dfn[x]=low[x]=++tim;stack[++top]=x,vis[x]=true;for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;if(vis[t]) low[x]=min(low[x],dfn[t]);else if(!dfn[t]) tarjan(t),low[x]=min(low[t],low[x]);}if(low[x]==dfn[x]){s++,sum[s]++,belong[x]=s;for(;stack[top]!=x;top--){sum[s]++;vis[stack[top]]=false;belong[stack[top]]=s;}top--,vis[x]=false;}
}
int shink_point()
{for(int i=1;i<=n;i++)for(int j=head[i];j;j=edge[j].next){int t=edge[j].to;if(belong[i]!=belong[t]) add1(belong[i],belong[t]);}
}
int dfs1(int x)
{vis1[x]=true;for(int i=head1[x];i;i=edge1[i].next){int t=edge1[i].to;if(ans1[t]<ans1[x]+sum[t])ans1[t]=ans1[x]+sum[t],dfs1(t);}
}
int dfs2(int x)
{vis2[x]=true;for(int i=head2[x];i;i=edge2[i].next){int t=edge2[i].to;if(ans2[t]<ans2[x]+sum[t])ans2[t]=ans2[x]+sum[t],dfs2(t);}
}
int main()
{n=read(),m=read();for(int i=1;i<=m;i++)xx[i]=read(),yy[i]=read(),add(xx[i],yy[i]);for(int i=1;i<=n;i++)if(!dfn[i]) tarjan(i);shink_point();ans1[belong[1]]=ans2[belong[1]]=sum[belong[1]];dfs1(belong[1]);dfs2(belong[1]);int answer=2*sum[belong[1]];for(int i=1;i<=m;i++){x=belong[yy[i]],y=belong[xx[i]];if(vis1[x]&&vis2[y])answer=max(answer,ans1[x]+ans2[y]);}printf("%d",answer-sum[belong[1]]);return 0;
}

#include<queue>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 210000
using namespace std;
int n,m,x,y,s,tot,tat,top,tim;
bool vis[N],vis1[N],vis2[N];
int xx[N],yy[N],in1[N],in2[N],head1[N],head2[N],dfn[N];
int low[N],sum[N],ans1[N],ans2[N],head[N],stack[N],belong[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1; ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}return x*f;
}
struct Edge
{int to,from,next;
}edge[N],edge1[N],edge2[N];
int add(int x,int y)
{tot++;edge[tot].to=y;edge[tot].next=head[x];head[x]=tot;
}
int add1(int x,int y)
{tat++;edge1[tat].to=y;edge1[tat].next=head1[x];edge2[tat].to=x;edge2[tat].next=head2[y];head1[x]=head2[y]=tat;
}
int tarjan(int now)
{dfn[now]=low[now]=++tim;vis[now]=true;stack[++top]=now;for(int i=head[now];i;i=edge[i].next){int t=edge[i].to;if(vis[t]) low[now]=min(dfn[t],low[now]);else if(!dfn[t]) tarjan(t),low[now]=min(low[t],low[now]);}if(low[now]==dfn[now]){s++,belong[now]=s,sum[s]++;for(;stack[top]!=now;top--)belong[stack[top]]=s,sum[s]++,vis[stack[top]]=false;vis[now]=false;top--;    }
}
int shink_point()
{for(int i=1;i<=m;i++)for(int j=head[i];j;j=edge[j].next)if(belong[i]!=belong[edge[j].to])add1(belong[i],belong[edge[j].to]);
}
int dfs1(int s)
{for(int i=head1[s];i;i=edge1[i].next){int t=edge1[i].to;if(!in1[t]) dfs1(t);in1[t]++;}
}
int dfs2(int s)
{for(int i=head2[s];i;i=edge2[i].next){int t=edge2[i].to;if(!in2[t]) dfs2(t);in2[t]++;}
}
int tpsort(int *in,Edge *edge,int *head,bool *vis,int *ans)
{queue<int>q;q.push(belong[1]);while(!q.empty()){int x=q.front();q.pop();vis[x]=true;for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;in[t]--;if(!in[t]) q.push(t);ans[t]=max(ans[t],ans[x]+sum[t]);}}
}
int main()
{n=read(),m=read();int answer=0;for(int i=1;i<=m;i++)xx[i]=read(),yy[i]=read(),add(xx[i],yy[i]);for(int i=1;i<=n;i++)if(!dfn[i]) tarjan(i);shink_point();dfs1(belong[1]),dfs2(belong[1]);ans1[belong[1]]=ans2[belong[1]]=sum[belong[1]];tpsort(in1,edge1,head1,vis1,ans1);tpsort(in2,edge2,head2,vis2,ans2);answer=2*sum[belong[1]];for(int i=1;i<=m;i++){x=belong[yy[i]],y=belong[xx[i]];if(vis1[x]&&vis2[y])answer=max(answer,ans1[x]+ans2[y]);}printf("%d",answer-sum[belong[1]]);return 0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 1010
using namespace std;
bool vis[N];
int n,m,e,x,y,ans,girl[N],map[N][N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
int find(int x)
{for(int i=1;i<=m;i++)if(map[x][i]&&!vis[i]){vis[i]=true;if(find(girl[i])||!girl[i]){girl[i]=x;return true;}}return false;
}
int main()
{n=read(),m=read(),e=read();for(int i=1;i<=e;i++)x=read(),y=read(),map[x][y]=1;for(int i=1;i<=n;i++){memset(vis,0,sizeof(vis));if(find(i)) ans++;}printf("%d",ans);return 0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 1010
using namespace std;
bool vis[N];
int n,m,e,x,y,ans,girl[N],map[N][N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
int find(int x)
{for(int i=1;i<=n;i++)if(map[x][i]&&!vis[i]){vis[i]=true;if(find(girl[i])||!girl[i]){girl[i]=x;return 1;}}return 0;
}
int main()
{n=read(),m=read();for(int i=1;i<=m;i++)x=read(),y=read(),map[x][y]=1;for(int i=1;i<=n;i++){memset(vis,0,sizeof(vis));if(find(i)) ans++;}printf("%d",ans);return 0;} 

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 1010
using namespace std;
bool vis[N];
int n,m,k,x,y,ans,girl[N],map[N][N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
int find(int x)
{for(int i=1;i<=m;i++)if(map[x][i]&&!vis[i]){vis[i]=true;if(find(girl[i])||girl[i]==-1){girl[i]=x;return 1;}}return 0;
}
int main()
{while(scanf("%d%d",&n,&m)!=EOF){ans=0;memset(map,0,sizeof(map));memset(girl,-1,sizeof(girl));for(int i=1;i<=n;i++){k=read();while(k--) x=read(),map[i][x]=1;}for(int i=1;i<=n;i++){memset(vis,0,sizeof(vis));if(find(i)) ans++;}printf("%d\n",ans);}return 0;} 

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 1010
using namespace std;
bool vis[N];
int n,m,k,x,y,z,ans,girl[N],map[N][N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1; ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}return x*f;
}
int find(int x)
{for(int i=1;i<=m;i++){if(!vis[i]&&map[x][i]){vis[i]=true;if(girl[i]==-1||find(girl[i])) {girl[i]=x; return 1;}}}return 0;
}
int main()
{while(1){n=read();if(n==0) break;m=read(),k=read();ans=0;memset(map,0,sizeof(map));memset(girl,-1,sizeof(girl));for(int i=1;i<=k;i++){z=read(),x=read(),y=read();map[x][y]=1;}for(int i=1;i<=n;i++){memset(vis,0,sizeof(vis));if(find(i)) ans++;}printf("%d\n",ans);}return 0;
}

#include<queue>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 510
using namespace std;
bool flag,vis[N];
int n,m,x,y,tot,ans,col[N],girl[N],head[N],map[N][N];
queue<int>q;
struct Edge
{int from,to,next;
}edge[N*N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1; ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}return x*f;
}
int add(int x,int y)
{tot++;edge[tot].to=y;edge[tot].next=head[x];head[x]=tot;
}
int find(int x)
{for(int i=1;i<=n;i++){if(!vis[i]&&map[x][i]){vis[i]=true;if(girl[i]==-1||find(girl[i])){girl[i]=x; return 1;}}}return 0;
}
int color(int s)
{queue<int>q;q.push(s); col[s]=0;while(!q.empty()){int x=q.front();for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;if(col[t]!=-1){if(col[t]==col[x]) {flag=true; return 1;}}else{col[t]=col[x]^1;q.push(t);}}q.pop();}return 0;
}
int main()
{while(scanf("%d%d",&n,&m)!=EOF){ans=0;flag=false;tot=0;memset(map,0,sizeof(map));memset(col,-1,sizeof(col));memset(edge,0,sizeof(edge));memset(head,0,sizeof(head));for(int i=1;i<=m;i++){x=read(),y=read();map[x][y]=1;add(x,y),add(y,x);}for(int i=1;i<=n;i++)if(col[i]==-1){if(color(i)) break;} if(flag) {printf("No\n"); continue;}memset(girl,-1,sizeof(girl));for(int i=1;i<=n;i++){memset(vis,0,sizeof(vis));if(find(i)) ans++;}printf("%d\n",ans);}return 0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 501000
using namespace std;
int n,m,tot,x,y,root;
int fa[N],top[N],size[N],deep[N],head[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;
}
struct Edge
{int to,next;
}edge[N<<1];
int add(int x,int y)
{tot++;edge[tot].to=y;edge[tot].next=head[x];head[x]=tot;
}
int dfs(int x)
{size[x]=1;deep[x]=deep[fa[x]]+1;for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;if(fa[x]==t) continue;fa[t]=x,dfs(t);size[x]+=size[t];}
}
int dfs1(int x)
{int t=0;if(!top[x]) top[x]=x;for(int i=head[x];i;i=edge[i].next){int to=edge[i].to;if(fa[x]!=to&&size[t]<size[to]) t=to;}if(t) top[t]=top[x],dfs1(t);for(int i=head[x];i;i=edge[i].next){int to=edge[i].to;if(fa[x]!=to&&to!=t) dfs1(to);}
}
int LCA(int x,int y)
{for(;top[x]!=top[y];x=fa[top[x]])if(deep[top[x]]<deep[top[y]])swap(x,y);if(deep[x]>deep[y]) swap(x,y);return x;
}
int main()
{n=read(),m=read(),root=read();for(int i=1;i<n;i++)x=read(),y=read(),add(x,y),add(y,x);dfs(root),dfs1(root);for(int i=1;i<=m;i++){x=read(),y=read();printf("%d\n",LCA(x,y));}return 0;
}