#include <fstream>
#include <algorithm>
#include <vector>
#define nmax (int)(3e4+1)
using namespace std;
ifstream cin("count.in");
ofstream cout("count.out");
int n,m,maxi,nr,x,y;
vector<int>v[nmax],aux;
bool Search(int nod,int x){
    if(nod<x)
        swap(x,nod);
    int st=0,dr=v[x].size();
    if(dr==0)
        return 0;
    while(st<=dr){
        int mid=(st+dr)/2;
        if(v[x][mid]==nod)
            return 1;
        else if(v[x][mid]>nod)
            dr=mid-1;
        else
            st=mid+1;
    }
    return 0;
}
bool valid(int nod){
    for(auto i:aux)
        if(Search(nod,i)==0)
            return 0;
    return 1;
}
void bck(int nod,int p,int x){
    aux.push_back(nod);
    int dim=aux.size();
    if(dim>maxi)
        maxi=dim,nr=1;
    else if(maxi==dim)
        nr++;
    for(int i=p;i<m;i++)
        if(valid(v[x][i]))
            bck(v[x][i],i+1,x);
    aux.pop_back();
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>x>>y;
        if(x<y)
            v[x].push_back(y);
        else
            v[y].push_back(x);
    }
    for(int i=1;i<=n;i++)
        sort(v[i].begin(),v[i].end());
    if(n<=2000){/// brut
        for(int start=1;start<=n;start++){
            m=v[start].size();
            aux.clear();
            bck(start,0,start);
        }
        cout<<maxi<<" "<<nr;
        return 0;
    }
    for(int start=1;start<=n;start++){/// sunt cazuri in care nu merge pentru ca nu le numara pe toate
        int m=v[start].size();
        for(int i=0;i<m;i++){/// cautam intial 2 noduri pe care sa le adaugam
            for(int j=i+1;j<m;j++){
                if(Search(v[start][i],v[start][j])){
                    aux.clear();
                    aux.push_back(v[start][i]);
                    aux.push_back(v[start][j]);
                    for(int k=j+1;k<m;k++)/// acum incercam sa mai adaugam noduri noi
                        if(valid(v[start][k]))
                            aux.push_back(v[start][k]);
                    int dim=aux.size()+1;
                    if(maxi<dim)
                        maxi=dim,nr=1;
                    else if(maxi==dim)
                        nr++;
                }
            }
        }
    }
    cout<<maxi<<" "<<nr;
    return 0;
}