Description

Given a tree, output the root root of the tree, the node with the most children max and its children.

Format

Input

The first line: n (number of nodes≤100), m (number of edges≤200).

The following m lines; each line has two nodes x and y, indicating that y is a child of x (x,y≤100).

Output

First line: tree root: root.

The second line: the node with the most children max.

The third line: the children of max.

Samples

Enter Data 1

8 74 14 21 31 52 62 72 8

Output data 1

426 7 8

Limitation

1s, 1024KiB for each test case.

Solution:

Although the standard answer is to use a binary tree, But!I prefer a binary tree!I'm going to use tag arrays!That's right!It's that simple array of tags!

Program:

#includeusing namespace std;int m,n,f,a[110],b[210],z[110],maxn;int main(){cin>>n>>m;for(int i=1;i<=m;i++)cin>>a[i]>>b[i];for(int i=1;i<=m;i++)z[b[i]]++;for(int i=1;i<=n;i++)if(!z[i])cout<=maxn)maxn=z[i];for(f=1;f<=n;f++){if(z[f]==maxn){cout<