#include <cstdio>
#include <vector>
#include <algorithm>
#define NMAX 30003
#define MOD 101
using namespace std;
int n,m;
struct str
{
    int in;
    int nod;
}ind[NMAX];
int mar,ct;
vector<int> h[NMAX][MOD],adj[NMAX];
bool rem[NMAX];
void addhash(int p1,int p2)
{
    h[p1][p2%MOD].push_back(p2);
}
int comp(const str &a,const str &b)
{
    return a.in<b.in;
}
int gas(int p1,int p2)
{
    int key=p2%MOD;
    vector<int>::iterator it;
    for(it=h[p1][key].begin();it!=h[p1][key].end();++it)
    {
        if(*it==p2) return 1;
    }
    return 0;
}
void gen(int nod)
{
    int mar=adj[nod].size();
    for(int i=0;i<mar;i++)
    {
        if(rem[adj[nod][i]]==1) continue;
        for(int j=i+1;j<mar;j++)
        {
            if(rem[adj[nod][j]]==1) continue;
            if(gas(adj[nod][i],adj[nod][j])==1) ct++;
        }
    }
    rem[nod]=1;
}
int main()
{
    freopen ("count.in","r",stdin);
    freopen ("count.out","w",stdout);
    scanf("%d%d",&n,&m);
    int x1,x2;
    for(int i=1;i<=n;i++) ind[i].nod=i;
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&x1,&x2);
        addhash(x1,x2);
        addhash(x2,x1);
        ind[x1].in++;
        ind[x2].in++;
        adj[x1].push_back(x2);
        adj[x2].push_back(x1);
    }
    sort(ind+1,ind+n+1,comp);
    for(int i=1;i<=n;i++)
    {
        gen(ind[i].nod);
    }
    printf("3 %d\n",ct);
}