蒟蒻求调

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=210;
vector<int> p[N];
int t;
int n,m; 
signed main()
{
	cin>>t;
	while(t--){
		cin>>n>>m;
		for(int i=0;i<N;i++) p[i].clear();
		while(m--){
			int u,v;
			cin>>u>>v;
			p[u].push_back(v);
			p[v].push_back(u); 
		}
		map<int,int> mp;
		mp.clear();
		for(int i=1;i<=n;i++) mp[p[i].size()-1]++;
		int x,y;
		int maxv=0;
		for(auto e:mp){
		    if(e.second==1)
		        x=e.first+1;
		    maxv=max(maxv,e.second);
		}
		cout<<x<<' '<<maxv/x<<endl;
	}
	return 0;
}