#include <bits/stdc++.h>
using namespace std;

#define int long long


const int modulo = 1e9+7;

int32_t main(){
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	int n,m;
	cin >> n >> m;
	vector<vector<int>> adj(n+1);
	vector<pair<int,int>> edges(m);
	for(int i=0;i<m;i++){
		int a,b;
		cin >> a >> b;
		edges[i]={a,b};
		adj[a].emplace_back(b);
		adj[b].emplace_back(a);
	}
	vector isArt(n+1,vector(n+1,false));
	for(int i=1;i<=n;i++){
		vector<int> visited(n+1);
		vector<int> child(n+1);
		function<int(int,int,int)> dfs = [&](int x,int p,int depth){
			visited[x]=depth;
			int DP = 0;
			bool isLeaf = true;
			for(int&y:adj[x])if(y!=p){
				if(visited[y]){
					if(y!=i and visited[y]<depth)DP++;
					else if(visited[y]>depth)DP--;
					continue;
				}
				auto t = dfs(y,x,depth+1);
				DP+=t;
				isLeaf=false;
				if(t==0){isArt[i][x]=true;}
				child[x]++;
			}
			if(DP==0 and !isLeaf)isArt[i][x]=true;
			return DP;
		};
		visited[i]=1;
		assert(dfs(adj[i].front(),i,2)==0);
		if(child[adj[i].front()]==1)isArt[i][adj[i].front()]=false;
		bool works = true;
		for(int&x:adj[i])if(!visited[x])works=false;
		if(!works){
			for(int j=1;j<=n;j++)isArt[i][j]=true;
		}
	}
	int ans = 0;
	for(int i=0;i<m;i++){
		if(isArt[edges[i].first][edges[i].second])ans++;
	}
	cout << ans << '\n';
}