#include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>

using std::string;
using std::vector;
using std::set;
using std::multiset;
using std::unordered_set;
using std::map;
using std::multimap;
using std::unordered_map;
using std::pair;
using std::cin;
using std::cout;

using boost::multiprecision::cpp_int;
using cpp_dec_float_1000 = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1000, boost::int128_type>>;

typedef uintmax_t    ull;
typedef intmax_t     ll;
typedef uint64_t     ul;
typedef uint32_t     ui;
typedef uint8_t      uc;

constexpr char CRLF  = '\n';
constexpr char SPACE = ' ';
constexpr char VECTOR_COUT_SEPARATOR = SPACE;
constexpr ll INF = 1000'000'007;
constexpr int MOD = 1000'000'007;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> std::ostream& operator<< (std::ostream& os, const std::vector<T>& vc) { for(auto it = vc.begin(); it != vc.end(); ++it) { if (std::next(it) == vc.end()) os << *it; else os << *it << VECTOR_COUT_SEPARATOR; } return os; }
template<class T1, class T2> inline std::ostream & operator<< (std::ostream & os, const std::pair<T1, T2> & p) { return os << p.first << ' ' << p.second; }
template<class T> T modinv(T a, T m) { T b = m, u = 1, v = 0; while (b) { T t = a / b; a -= t * b; boost::swap(a, b); u -= t * v; boost::swap(u, v); } u %= m; if (u < 0) u += m; return u; }
template<class T> inline bool isSosuu(const T& n) { if (n == T(1)) { return false; } for (T i = 2; i*i <= n; ++i) { if (n % i == 0) { return false; } } return true; }
template<class T> vector<vector<T>> split (const vector<T>& S, T delim) { vector<vector<T>> ret{}; vector<T> buff{}; for (auto c : S) { if (c == delim) { if (!buff.empty()) ret.push_back(buff); buff.clear(); } else { buff.push_back(c); } } if (!buff.empty()) ret.push_back(buff); return ret; }

struct Tmp
{
public:
  using P = pair<int, int>;
  using B = std::bitset<64>;
  int N, M;
  vector<vector<P>> graph;
  vector<int> edgeMemo;
  vector<ull> nodeMemo;
  Tmp(int N, int M)
  : N(N)
  , M(M)
  , graph(N)
  , edgeMemo(M)
  , nodeMemo(N)
  {
    for (int i = 0; i < N; ++i) {
      nodeMemo[i] = 1LL << i;
    }
  }

  int operator()() {
    int res{};
    for (int i = 0; i < M; ++i) {
      if (isBridge(i)) {
        ++res;
      }
    }
    return res;
  }

  int isBridge(int m) {
    for (int i = 0; i < N; ++i) {
      boost::fill(edgeMemo, 0);
      edgeMemo[m] = 1;
      auto ret = rec(i);
      int num = B(ret).count();
      if (num != N) {
        return true;
      }
    }
    return false;
  }

  ull rec(int n) {
    auto res = nodeMemo[n];
    for (const auto& p : graph[n]) {
      auto next = p.first;
      auto edgeIndex = p.second;
      if (!edgeMemo[edgeIndex]) {
        edgeMemo[edgeIndex] = 1;
        res |= rec(next);
      }
    }
    return res;
  }
};

void solve(void)
{
  int N, M; cin >> N >> M;
  Tmp t(N, M);
  for (int i = 0; i < M; ++i) {
    int a, b; cin >> a >> b;
    --a; --b;
    t.graph[a].push_back({b, i});
    t.graph[b].push_back({a, i});
  }
  auto ans = t();
  cout << ans << CRLF;
  return;
}

int main(void)
{
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(0);

  solve();

  return 0;
}


Measured memory_bytes: 256