using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Linq;
using System.Text;

namespace ABC075C
{
    class Program
    {
        static void Solve()
        {
            var n = Input.NextInt();
            var m = Input.NextInt();
            var a = new int[m];
            var b = new int[m];

            for (int i = 0; i < m; i++)
            {
                a[i] = Input.NextInt() - 1;
                b[i] = Input.NextInt() - 1;
            }

            var count = 0;
            for (int i = 0; i < m; i++)
            {
                var uf = new UnionFind(n);
                for (int j = 0; j < m; j++)
                {
                    if (i == j) continue;
                    uf.Merge(a[j], b[j]);
                }

                if (!uf.Same(a[i], b[i]))
                {
                    // iをつながなかったことにより、未連結となった
                    // → （iは橋だった）
                    count++;
                }
            }

            Console.WriteLine(count);

        }

        /// <summary>
        /// アイテムを含まないUF木
        /// </summary>
        class UnionFind
        {
            List<int> rank { get; set; }
            List<int> size { get; set; }
            List<int> parentId { get; set; }

            public UnionFind(int size)
            {
                this.rank = Enumerable.Repeat(0, size).ToList();
                this.size = Enumerable.Repeat(1, size).ToList();
                this.parentId = Enumerable.Range(0, size).ToList();
            }

            /// <summary>
            /// 同一の親を持つか
            /// </summary>
            /// <param name="x"></param>
            /// <param name="y"></param>
            /// <returns></returns>
            public bool Same(int x, int y)
            {
                return FindRoot(x) == FindRoot(y);
            }

            /// <summary>
            /// 指定ノードのrootを返す
            /// </summary>
            /// <param name="x"></param>
            /// <returns></returns>
            public int FindRoot(int x)
            {
                if (x != this.parentId[x])
                {
                    // 経路中のノードのparentを更新しておく
                    this.parentId[x] = FindRoot(this.parentId[x]);
                }

                return this.parentId[x];
            }

            /// <summary>
            /// 重みをつけて合体する
            /// </summary>
            /// <param name="x"></param>
            /// <param name="y"></param>
            /// <param name="w"></param>
            public void Merge(int x, int y)
            {
                x = FindRoot(x);
                y = FindRoot(y);

                if (x == y) return;

                if (this.rank[y] < this.rank[x])
                {
                    this.parentId[y] = x;
                    this.size[x] += this.size[y];
                }
                else
                {
                    this.parentId[x] = y;
                    this.size[y] += this.size[x];

                    if (this.rank[x] == this.rank[y])
                    {
                        this.rank[y]++;
                    }
                }
            }

            /// <summary>
            /// xと同じ親を持つノードの数
            /// </summary>
            /// <param name="x"></param>
            /// <returns></returns>
            public int Size(int x)
            {
                x = FindRoot(x);

                return this.size[x];
            }
        }

        #region Competitive Template
        public static void Main(string[] args)
        {
            var needsFlushOutput = true;
            if (needsFlushOutput)
            {
                // 細かく出力しないようにする
                var sw = new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
                Console.SetOut(sw);
            }

            // 仮想的に標準入力をセットする
            // NextLine系を使っていると使えない
            //Input.SetText("");

            Solve();

            Console.Out.Flush();
        }

        static class Input
        {
            static char[] separator = { ' ' };
            public static bool IsEof { get; set; }
            static Queue<string> q { get; set; }

            static Input()
            {
                IsEof = false;
                q = new Queue<string>();
            }

            /// <summary>
            /// 入力予約
            /// </summary>
            /// <param name="items"></param>
            public static void SetText(IEnumerable<string> items)
            {
                foreach (var item in items)
                {
                    SetText(item);
                }
            }

            /// <summary>
            /// 入力予約
            /// </summary>
            /// <param name="s"></param>
            /// <returns></returns>
            public static bool SetText(string s)
            {
                if (s == null) return false;

                foreach (var elem in s.Trim().Split(separator, StringSplitOptions.RemoveEmptyEntries))
                {
                    q.Enqueue(elem);
                }

                return true;
            }

            /// <summary>
            /// 内部queueに入力からの値をsplitして格納する
            /// </summary>
            /// <returns></returns>
            static bool read()
            {
                var s = Console.ReadLine();
                if (s == null) return false;

                foreach (var elem in s.Trim().Split(separator, StringSplitOptions.RemoveEmptyEntries))
                {
                    q.Enqueue(elem);
                }

                if (!q.Any()) return read();

                return true;
            }

            /// <summary>
            /// 次のstringを一つ読み込む
            /// </summary>
            /// <returns></returns>
            public static string Next()
            {
                if (!q.Any())
                {
                    if (!read())
                    {
                        IsEof = true;
                        return "";
                    }
                }

                return q.Dequeue();
            }

            public static int NextInt() => int.Parse(Next());
            public static long NextLong() => long.Parse(Next());
            public static double NextDouble() => double.Parse(Next());

            public static List<string> Next(int n) => Enumerable.Range(0, n).Select(_ => Next()).ToList();
            public static List<int> NextInt(int n) => Next(n).Select(x => int.Parse(x)).ToList();
            public static List<long> NextLong(int n) => Next(n).Select(x => long.Parse(x)).ToList();
            public static List<double> NextDouble(int n) => Next(n).Select(x => double.Parse(x)).ToList();

            public static List<string> NextLine() => Console.ReadLine().Trim().Split(separator, StringSplitOptions.RemoveEmptyEntries).ToList();
            public static List<int> NextIntLine() => NextLine().Select(x => int.Parse(x)).ToList();
            public static List<long> NextLongLine() => NextLine().Select(x => long.Parse(x)).ToList();
            public static List<double> NextDoubleLine() => NextLine().Select(x => double.Parse(x)).ToList();
        }
        #endregion
    }
}


Measured memory_bytes: 13524