#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define inf -0x3f3f3f3f
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define mem(a, b) memset(a, b, sizeof(a))
typedef long long ll;
int mp[110][110];

int main(){
    int n,m;
    int u,v;
    while(scanf("%d%d",&n,&m)!=EOF){
        mem0(mp);
        for(int i=1;i<=m;i++){
            scanf("%d%d",&u,&v);
            mp[u][v]=mp[v][u]=1;
        }
        if(mp[1][n]==1){
            printf("1 %d\n",n*(n-1)/2);
        }
        else{
            printf("1 1\n");
        }
    }
    return 0;
}