#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<iomanip>
#include<cstdlib>
#define maxn 100010
#define maxm maxn*2
#define ll long long
using namespace std;
ll n,fir[maxn],nxt[maxm],v[maxm],cnt,m,p;
ll dp[5][maxn][20],f[maxn],son[maxn];
bool vis[maxn][20];
ll read(){ll x=0,f=1;char ch=getchar();while(isdigit(ch)==0 && ch!='-')ch=getchar();if(ch=='-')f=-1;while(isdigit(ch))x=x*10+ch-'0',ch=getchar();return x*f;
}
ll log2(ll x){for(ll tmp=1,i=0;;tmp<<=1,i++){if(tmp*2>x||tmp>=x)return i;}
}
void addedge(ll u1,ll v1){v[cnt]=v1,nxt[cnt]=fir[u1],fir[u1]=cnt++;}
ll getf(ll u){return f[u]<0?u:(f[u]=getf(f[u]));}
void add(ll u,ll v){ll fu=getf(u),fv=getf(v);if(fu==fv)return;if(fu>fv)swap(fu,fv);f[fu]+=f[fv];f[fv]=fu;
}
ll mod(ll x){return (x%p==0 && x!=0)?p:x%p;
}
void solve(ll u,ll dep){if(vis[u][dep])return;vis[u][dep]=1;for(ll k=fir[u];k!=-1;k=nxt[k]){ll vv=v[k];if(vv!=f[u]){f[vv]=u;solve(vv,dep);solve(vv,dep-1);ll x=dp[0][vv][dep]+dp[1][vv][dep],//One road to tree vv. y=dp[0][vv][dep-1]+dp[1][vv][dep-1]+dp[2][vv][dep-1];//No roads to tree vv.x=mod(x),y=mod(y);dp[2][u][dep]=mod(dp[2][u][dep]*y+dp[1][u][dep]*x);dp[1][u][dep]=mod(dp[1][u][dep]*y+dp[0][u][dep]*x);dp[0][u][dep]=mod(dp[0][u][dep]*y);}}
}
int main(){//freopen(".in","r",stdin);//freopen(".out","w",stdout);n=read(),m=read(),p=read();memset(f,-1,sizeof(f));memset(fir,-1,sizeof(fir));for(ll i=1;i<=m;i++){ll x=read(),y=read();addedge(x,y);addedge(y,x);add(x,y);}if(f[1]!=-n)cout<<-1<<endl<<-1;else{memset(f,-1,sizeof(f));ll lim=log2(n);for(ll i=1;i<=n;i++){for(ll j=0;j<=lim;j++){dp[0][i][j]=1;dp[1][i][j]=dp[2][i][j]=0;}}for(ll i=0;i<=lim;i++){solve(1,i);if(dp[0][1][i]!=0 || dp[1][1][i]!=0 || dp[2][1][i]!=0){cout<<i<<endl<<(dp[0][1][i]%p+dp[1][1][i]%p+dp[2][1][i]%p)%p;break;}}}return 0;
}
/*
5 4 100
1 2
4 5
1 3
4 1
*/