#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

template<int um> class UF {
	public:
	vector<int> par,rank,cnt;
	UF() {par=rank=vector<int>(um,0); cnt=vector<int>(um,1); for(int i=0;i<um;i++) par[i]=i;}
	void reinit(int num=um) {int i; FOR(i,num) rank[i]=0,cnt[i]=1,par[i]=i;}
	int operator[](int x) {return (par[x]==x)?(x):(par[x] = operator[](par[x]));}
	int count(int x) { return cnt[operator[](x)];}
	int operator()(int x,int y) {
		if((x=operator[](x))==(y=operator[](y))) return x;
		cnt[y]=cnt[x]=cnt[x]+cnt[y];
		if(rank[x]>rank[y]) return par[x]=y;
		rank[x]+=rank[x]==rank[y]; return par[y]=x;
	}
};
UF<10101> uf;
int N,M;
int A[10101],B[10101];
int ma[5050],mi[5050];
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	FOR(i,M) {
		cin>>x>>y;
		uf(x-1,N+y-1);
	}
	FOR(i,N) A[uf[i]]++;
	FOR(i,N) B[uf[N+i]]++;
	int SA=0,SB=0;
	FOR(i,2*N) if(A[i]+B[i]==1) {
		if(A[i]==1) SA++;
		if(B[i]==1) SB++;
	}
	FOR(i,N+1) ma[i]=-1<<30,mi[i]=1<<30;
	FOR(i,SA+1) ma[i]=SB,mi[i]=0;
	FOR(i,2*N) if(A[i]+B[i]>1) {
		for(j=N;j>=0;j--) if(ma[j]>=0) {
			ma[j+A[i]]=max(ma[j+A[i]],ma[j]+B[i]);
			mi[j+A[i]]=min(mi[j+A[i]],mi[j]+B[i]);
		}
	}
	int ret=1LL<<30;
	FOR(i,N+1) if(ma[i]>=0) {
		ret=min(ret,i*ma[i]+(N-i)*(N-ma[i])-M);
		ret=min(ret,i*mi[i]+(N-i)*(N-mi[i])-M);
	}
	cout<<ret<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}