# include<iostream>

# include<cstdio>

# include<cmath>

# include<cstring>

# include<algorithm>

# include<queue>

using namespace std;

const int mn = ;

struct Grap{

    struct edge{int to,next;};

    edge e[mn*];

    int head[mn],edge_max;

    void add(int x,int y)

    {

        e[++edge_max].to=y;

        e[edge_max].next=head[x];

        head[x]=edge_max;

    }

}A,B;

int deg[mn*],n,m,a[mn*];

int f[mn*],g[mn*];

void topolpgy()

{

    int tail=,head=;

    for(int i=;i<=n;i++)

        if(!deg[i]) a[++head]=i;

    //printf("%d %d\n",tail,head);

    while(tail<=head)

    {

        int u=a[tail];

        tail++;

        for(int i=A.head[u];i;i=A.e[i].next)

        {

            deg[A.e[i].to]--;

            if(!deg[A.e[i].to]) a[++head]=A.e[i].to;

        }

    }

}

struct Heap{

    int heap[mn*],mark[mn*],top;

    void ins(int x)

    {

        if(mark[x])

        {

            --mark[x];

            return ;

        }

        heap[++top]=x;

        int t=top;

        while(t>)

        {

            if(heap[t]>heap[t>>])

                swap(heap[t],heap[t>>]),t>>=;

            else

                break;

        }

    }

    void del(int x)

    {

        mark[x]++;

    }

    void Pop()

    {

        heap[]=heap[top--];

        int t=;

        while(t<=top)

        {

            if( t<top && heap[t+]>heap[t] )

                t++;

            if(heap[t]>heap[t>>])

                swap(heap[t],heap[t>>]),t<<=;

            else

                break;

        }

    }

    int Top()

    {

        while(mark[heap[]])

            mark[heap[]]--,Pop();

        return heap[];

    }

}T;

int main()

{

    int x,y;

    A.edge_max=,B.edge_max=;

    scanf("%d%d",&n,&m);

    for(int i=;i<=m;i++)

    {

        scanf("%d%d",&x,&y);

        A.add(x,y),B.add(y,x);

        deg[y]++;

    }

    topolpgy();

    /*for(int i=1;i<=n;i++)

        printf("%d ",a[i]);*/

    int ans=,ans_len=0x3f3f3f3f;

    for(int i=;i<=n;i++)

    {

        int u=a[i];

        f[u]=max(f[u],);

        for(int j=A.head[u];j;j=A.e[j].next)

            f[A.e[j].to]=max(f[A.e[j].to],f[u]+);

    }

    for(int i=n;i>=;i--)

    {

        int u=a[i];

        g[u]=max(g[u],);

        for(int j=A.head[u];j;j=A.e[j].next)

            g[u]=max(g[u],g[A.e[j].to]+);

    }

    /*for(int i=1;i<=n;i++)

        printf("%d:%d %d\n",i,f[i],g[i]);*/

    for(int i=;i<=n;i++)

        T.ins(g[i]);

    T.ins();

    for(int i=;i<=n;i++)

    {

        int u=a[i];

        for(int j=B.head[u];j;j=B.e[j].next)

        {

            T.del(f[B.e[j].to]+g[u]);

           //printf("%d ",f[B.e[j].to]+g[u]);

        }

        //printf("\n");

        T.del(g[u]);

        if(T.Top()<ans_len)

        {

            ans_len=T.Top(),ans=u;

            //printf("%d ",T.Top());

        }

        for(int j=A.head[u];j;j=A.e[j].next)

        {

            T.ins(f[u]+g[A.e[j].to]);

            //printf("%d ",f[u]+g[B.e[j].to]);

        }

        T.ins(f[u]);

        //printf("%d\n",ans_len-1);

    }

    printf("%d %d",ans,ans_len-);

    return ;

}