#include<cstdio>

#include<iostream>

#include<map>

#define ull unsigned long long

#define ll long long

#define R register int

using namespace std;

#define pause (for(R i=1;i<=10000000000;++i))

#define In freopen("NOIPAK++.in","r",stdin)

#define Out freopen("out.out","w",stdout)

namespace Fread {

static char B[<<],*S=B,*D=B;

#ifndef JACK

#define getchar() (S==D&&(D=(S=B)+fread(B,1,1<<15,stdin),S==D)?EOF:*S++)

#endif

inline int g() {

    R ret=,fix=; register char ch; while(!isdigit(ch=getchar())) fix=ch=='-'?-:fix;

    if(ch==EOF) return EOF; do ret=ret*+(ch^); while(isdigit(ch=getchar())); return ret*fix;

} inline bool isempty(const char& ch) {return (ch<=||ch>=);}

inline void gs(char* s) {

    register char ch; while(isempty(ch=getchar()));

    do *s++=ch; while(!isempty(ch=getchar()));

}

} using Fread::g; using Fread::gs;

namespace Luitaryi {

const int N=,M=;

map<pair<int,int>,bool> mp;

int n,m,mod;

int vr[M<<],nxt[M<<],fir[M<<],cnt;

inline void add(int u,int v) {vr[++cnt]=v,nxt[cnt]=fir[u],fir[u]=cnt;}

int vv[M<<],nn[M<<],ff[M<<],ct;

inline void adde(int u,int v) {vv[++ct]=v,nn[ct]=ff[u],ff[u]=ct;}

int dfn[N],low[N],c[N],stk[N],sz[N],t[N],num,cc,top;

bool vis[N];

inline void tarjan(int u) {

    dfn[u]=low[u]=++num; stk[++top]=u,vis[u]=true;

    for(R i=fir[u];i;i=nxt[i]) { R v=vr[i];

        if(!dfn[v]) {

            tarjan(v);

            low[u]=min(low[u],low[v]);

        } else if(vis[v]) low[u]=min(low[u],dfn[v]);

    } if(dfn[u]==low[u]) {

        ++cc; R tmp;

        do tmp=stk[top],--top,c[tmp]=cc,++sz[cc],vis[tmp]=false; while(tmp!=u);

    }

}

int anss,ans,mx[N],tot[N];

inline void dfs(int u) {

    vis[u]=true; mx[u]=sz[u],tot[u]=;

    for(R i=ff[u];i;i=nn[i]) { R v=vv[i];

        if(!vis[v]) dfs(v);

        if(sz[u]+mx[v]>mx[u]) {

            mx[u]=sz[u]+mx[v];

            tot[u]=tot[v];

        } else if(sz[u]+mx[v]==mx[u])

            tot[u]=(tot[u]+tot[v])%mod;

    } ans=max(mx[u],ans);

}

inline void main() {

    n=g(),m=g(),mod=g();

    for(R i=,u,v;i<=m;++i) u=g(),v=g(),add(u,v);

    for(R i=;i<=n;++i) if(!dfn[i]) tarjan(i);

    for(R u=;u<=n;++u) for(R i=fir[u];i;i=nxt[i]) { R v=vr[i];

        if(c[u]!=c[v]&&mp.find(make_pair(c[u],c[v]))==mp.end())

            ++t[c[v]],adde(c[u],c[v]),mp[make_pair(c[u],c[v])]=true;

    } for(R i=;i<=cc;++i) if(!t[i]||!vis[i]) dfs(i);

    for(R i=;i<=cc;++i) if(mx[i]==ans) anss=(anss+tot[i])%mod;

    printf("%d\n%d\n",ans,anss);

}

}

signed main() {

    Luitaryi::main();

    return ;

}