#include <fstream>
#include <algorithm>
#include <vector>
#include <unordered_map>
#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;
unordered_map<int,bool>mp[nmax];
bool valid(int nod){
    for(auto i:aux)
        if(mp[nod][i]==0)
            return 0;
    return 1;
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>x>>y;
        mp[x][y]=1;
        mp[y][x]=1;
        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());
    for(int start=1;start<=n;start++){
        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(mp[v[start][i]][v[start][j]]==1){
                    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;
}