#include 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 bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- int N; ll M; ll A[101010],B[101010]; template class UF { public: vector par,rank,cnt,G[um]; UF() {par=rank=vector(um,0); cnt=vector(um,1); for(int i=0;irank[y]) return par[x]=y; rank[x]+=rank[x]==rank[y]; return par[y]=x; } }; UF<404040> uf; int E[404040]; void solve() { int i,j,k,l,r,x,y; string s; vector Xs; cin>>N>>M; FOR(i,N) { cin>>A[i]>>B[i]; Xs.push_back(A[i]); Xs.push_back(B[i]); } sort(ALL(Xs)); Xs.erase(unique(ALL(Xs)),Xs.end()); M=Xs.size(); FOR(i,N) { x=lower_bound(ALL(Xs),A[i])-Xs.begin(); y=lower_bound(ALL(Xs),B[i])-Xs.begin(); x=uf[x]; y=uf[y]; if(x==y) { E[x]++; } else { E[x]=E[y]=E[x]+E[y]+1; uf(x,y); } } int ret=0; FOR(i,M) if(uf[i]==i) { ret+=min(uf.count(i),E[i]); } cout<