#define TEST_MODE true
 
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
 
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (a)-1; i >= (int)b; --i)
#define range(i, a, b, c) for (int i = a;		\
                               c > 0 ? i < b : i > b;	\
                               i += c)
#define chmax(a, b) (a = (a) < (b) ? (b) : (a))
#define chmin(a, b) (a = (a) > (b) ? (b) : (a))
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define all(a) begin(a), end(a)
#define ifnot(a) if (not(a))
#define int long long
 
#if TEST_MODE == true
const bool test = true;
#define dump(x) cerr << #x << " = " << (x) << " "
#define dumpl(x) cerr << #x << " = " << (x) << " " << endl;
#else
const bool test = false;
#define dump(x) 
#define dumpl(x) 
#endif
 
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
const int INF = (int)1 << 60;
const ll INFL = (ll)1 << 60;
ll mod_n = (int)1e9 + 7;
const double eps = 1e-10;
typedef long double Real;
// return -1, 0, 1
int sgn(const Real &r) { return (r > eps) - (r < -eps); }
int sgn(const Real &a, const Real &b) { return sgn(a - b); }
 
//.....................
const int MAX = (int)2e5 + 5;
 
vector<string> split(const string &str, char sep)
{
  vector<string> v;
  stringstream ss(str);
  string buffer;
  while (getline(ss, buffer, sep))
    {
      v.push_back(buffer);
    }
  return v;
}
 
template <class InputIterator>
int sum(InputIterator begin, InputIterator end)
{
  return accumulate(begin, end, 0ll);
}
 
template<typename T>
T gcd(T a, T b)
{
  T c;
  while (a != 0) {
    c = a; a = b%a;  b = c;
  }
  return b;
}
 
void solve();
 
class Solver {
public:
  int N, M;
  vector<vector<int>> graph;

  void tadoru(int ng_a, int ng_b, bool is_visited[], int cur) {
    rep(j, graph[cur].size()) {
      int a = cur;
      int b = graph[cur][j];
      if (a == ng_a && b == ng_b) continue;
      if (a == ng_b && b == ng_a) continue;
      
      if (is_visited[b]) continue;
      is_visited[b] = true;
      tadoru(ng_a, ng_b, is_visited, b);
    }
  }
  
  bool is_renketsu(int ng_a, int ng_b) {
    bool is_visited[55] = {};
    is_visited[0] = true;
    tadoru(ng_a, ng_b, is_visited, 0);
    cerr << endl;
    // dumpl(N);
    rep(i, N) {
      dumpl(is_visited[i]);
      if (is_visited[i] == false) {
	return false;
      }
    }
    return true;
  }
 
  void solve() {
    cin >> N >> M;
    graph.resize(N);
    rep(i, M) {
      int a, b;
      cin >> a >> b;
      a -= 1;
      b -= 1;
      graph[a].push_back(b);
      graph[b].push_back(a);
    }
    // cerr << "-------------------------------" << endl;
    // rep(i, N) {
    //   rep(j, graph[i].size()) {
    // 	cerr << i << " " << graph[i][j] << endl;
    //   }
    // }
    int cnt = 0;
    rep(i, N) {
      rep(j, graph[i].size()) {
	if (not is_renketsu(i, graph[i][j])) cnt += 1;
      }
    }
    cout << cnt / 2 << endl;
  }
};
 
signed main()
{
  srand(time(NULL));
  cout << fixed << setprecision(20);
  auto ptr = new Solver();
  ptr->solve();
  delete ptr;
  // while (true) {    
  //     auto ptr = new Solver();
  //     ptr->solve();
  //     delete ptr;
  // }
  return 0;
}
 
// class Mycin {
// 	bool flag = true;
// public:
// 	Mycin& operator >> (int& a) {flag = scanf("%lld", &a) != EOF; return *this;}
// 	Mycin& operator >> (char& a) {flag = scanf("%c", &a) != EOF; return *this;}
// 	Mycin& operator >> (string& s) {flag = (bool)(cin >> s); return *this;}
// 	operator bool() {return flag;}
// } mycin;
 
// class Mycout {
// public:
// 	Mycout& operator << (const int& a) {printf("%lld", a); return *this;}
// 	Mycout& operator << (const char c) {printf("%c", c); return *this;}
// 	Mycout& operator << (const string& s) {printf("%s", s.c_str()); return *this;}
// } mycout;
 
// #define cin mycin
// #define cout mycout
// #define endl '\n'


Measured memory_bytes: 256