/**************************************************************Problem: 1064User: BLADEVILLanguage: PascalResult: AcceptedTime:284 msMemory:34596 kb
****************************************************************/{$M 65536000}
//By BLADEVIL
varn, m                            :longint;pre, other, len                 :array[0..2000020] of longint;last                            :array[0..100010] of longint;l                               :longint;flag                            :array[0..100010] of boolean;size, father, key, tmin, tmax   :array[0..100010] of longint;g                               :array[0..2000100] of longint;ans1, ans2                      :longint;procedure swap(var a,b:longint);
varc                               :longint;
beginc:=a; a:=b; b:=c;
end;function min(a,b:longint):longint;
beginif a>b then min:=b else min:=a;
end;function max(a,b:longint):longint;
beginif a>b then max:=a else max:=b;
end;function gcd(a,b:longint):longint;
beginif b>a then swap(a,b);if b=0 then exit(a) else exit(gcd(b,a mod b));
end;procedure connect(x,y,z:longint);
begininc(l);pre[l]:=last[x];last[x]:=l;other[l]:=y;len[l]:=z;
end;procedure dfs(x:longint);
varq, p                            :longint;
beginflag[x]:=true;q:=last[x];while q<>0 dobeginp:=other[q];if len[q]=1 then father[p]:=x;if not flag[p] thenbeginflag[p]:=true;size[p]:=size[x]+len[q];key[p]:=key[x];dfs(p);end elsebegininc(g[0]);g[g[0]]:=abs(size[x]+len[q]-size[p]);if g[g[0]]=0 then dec(g[0]);end;q:=pre[q];end;
end;procedure init;
vari                               :longint;x, y                            :longint;
beginread(n,m);for i:=1 to m dobeginread(x,y);connect(x,y,1);connect(y,x,-1);end;for i:=1 to n do father[i]:=-1;for i:=1 to n do if not flag[i] then dfs(i);
end;procedure main;
vari                               :longint;
beginif g[0]=0 thenbeginfillchar(flag,sizeof(flag),false);for i:=1 to n do if (father[i]=-1) and (key[i]=0) thenbeginkey[i]:=i;dfs(i);end;for i:=1 to n do tmax[i]:=-maxlongint;for i:=1 to n do tmin[i]:=maxlongint;for i:=1 to n dobegintmax[key[i]]:=max(tmax[key[i]],size[i]);tmin[key[i]]:=min(tmin[key[i]],size[i]);end;for i:=1 to n do if tmin[i]<>maxlongint then inc(ans1,tmax[i]-tmin[i]+1);if ans1<3 thenbeginwriteln(-1,' ',-1);exit;end elsebeginwriteln(ans1,' ',3);exit;end;end elsebeginans1:=g[1];for i:=2 to g[0] doans1:=gcd(ans1,g[i]);if ans1<3 thenbeginwriteln(-1,' ',-1);exit;end elsebeginans2:=0;for i:=3 to ans1 doif ans1 mod i=0 thenbeginans2:=i;break;end;if ans2=0 then ans2:=ans1;writeln(ans1,' ',ans2);end;end;
end;begininit;main;
end.