cf New Reform 659E(dfs判断是否有环)

Berland has n cities connected by m bidirectional roads. No road connects a city to itself, and each pair of cities is connected by no more than one road. It is not guaranteed that you can get from any city to any other one, using only the existing roads.

The President of Berland decided to make changes to the road system and instructed the Ministry of Transport to make this reform. Now, each road should be unidirectional (only lead from one city to another).

In order not to cause great resentment among residents, the reform needs to be conducted so that there can be as few separate cities as possible. A city is considered separate, if no road leads into it, while it is allowed to have roads leading from this city.

Help the Ministry of Transport to find the minimum possible number of separate cities after the reform.

Input

The first line of the input contains two positive integers, n and m — the number of the cities and the number of roads in Berland (2 ≤ n ≤ 100 000, 1 ≤ m ≤ 100 000).

Next m lines contain the descriptions of the roads: the i-th road is determined by two distinct integers xi, yi (1 ≤ xi, yi ≤ n, xi ≠ yi), where xi and yi are the numbers of the cities connected by the i-th road.

It is guaranteed that there is no more than one road between each pair of cities, but it is not guaranteed that from any city you can get to any other one, using only roads.

Output

Print a single integer — the minimum number of separated cities after the reform.

Examples

Input

4 3
2 1
1 3
4 3

Output

1

Input

5 5
2 1
1 3
2 3
2 5
4 3

Output

0

Input

6 5
1 2
2 3
4 5
4 6
5 6

Output

1

 

n个城市 m条路 一开始m个路是双向的  现在政策改变路变成单向的  但是为了有更少的城市 问如何单向  最后入度为0的城市有几个

分析：如果一串节点连接 那么要是图 要么是树  如果是树的话那么有一个入度为0的根节点  如果一个图有环那么就是入度为0的是0 首先因为环里的节点入度是0 环外边的可以让环里的点指向环外边

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<string>
#include<vector>
using namespace std;
const int N=1e5+100;
vector<int>vec[N]; 
bool vis[N];
bool flag;
int path[N];
int t;
void dfs(int u,int pre)
{
	if(vis[u]){//再次访问说明有环 
		t=0;
		return;
	}
	vis[u]=true;
	for(int i=0;i<vec[u].size();i++){
		if(vec[u][i]!=pre){//这个保证了单向 a->b 就不 b->a 
			dfs(vec[u][i],u);
		}
	}
}
int main()
{
	int n,m;
	scanf("%d %d",&n,&m);
	for(int i=0;i<m;i++){
		int a,b;
		scanf("%d %d",&a,&b);
		vec[a].push_back(b);
		vec[b].push_back(a);
	}
	int cnt=0;
	memset(vis,false,sizeof(vis));
	for(int i=1;i<=n;i++){
		if(!vis[i]){
			t=1;
			dfs(i,0);
			cnt+=t;
		}
	}
	printf("%d\n",cnt);
	int x,y;
	scanf("%d %d",&x,&y);
	 
	return 0;
 }