#include <cstdio>
#include <cstdlib>
#include <queue>
#include <vector>
#include <tr1/unordered_map>
using namespace std;
using namespace tr1;

const int NMAX = 30010;

int N, M, X, Y, Deg[NMAX], CompleteGraphs[5];
vector<int> G[NMAX], Vec;
bool Used[NMAX];
priority_queue< pair<int, int>, vector< pair<int, int> >, greater< pair<int, int> > > Q;
tr1 :: unordered_map<int, bool> Edge[NMAX];

void Find(int Node)
{
    for(int i = 0; i < Vec.size(); ++ i)
        for(int j = i + 1; j < Vec.size(); ++ j)
        {
            int Vi = Vec[i], Vj = Vec[j];
            if(Edge[Node][Vi] && Edge[Node][Vj] && Edge[Vi][Vj])
            {
                CompleteGraphs[3] ++;
                for(int k = j + 1; k < Vec.size(); ++ k)
                {
                    int Vk = Vec[k];
                    if(Edge[Node][Vk] && Edge[Vi][Vk] && Edge[Vj][Vk])
                        CompleteGraphs[4] ++;
                }
            }
        }
}

int main()
{
    freopen("count.in", "r", stdin);
    freopen("count.out", "w", stdout);

    scanf("%i %i", &N, &M);
    for(int i = 1; i <= M; ++ i)
    {
        scanf("%i %i", &X, &Y);
        G[X].push_back(Y);
        G[Y].push_back(X);
        Deg[X] ++; Deg[Y] ++;
        Edge[X][Y] = Edge[Y][X] = 1;
    }

    for(int i = 1; i <= N; ++ i)
        Q.push(make_pair(Deg[i], i));

    CompleteGraphs[2] = M;

    for(int i = 1; i <= N; ++ i)
    {
        int Node = Q.top().second;
        Q.pop();

        if(Used[Node]) continue;
        Used[Node] = 1;

        Vec.clear();
        for(int j = 0; j < G[Node].size(); ++ j)
            if(!Used[ G[Node][j] ])
                Vec.push_back(G[Node][j]);

        Find(Node);

        for(int j = 0; j < Vec.size(); ++ j)
        {
            Deg[ Vec[j] ] --;
            Q.push(make_pair(Deg[ Vec[j] ], Vec[j]));
        }
    }

    for(int i = 4; i; -- i)
        if(CompleteGraphs[i])
        {
            printf("%i %i\n", i, CompleteGraphs[i]);
            return 0;
        }
}