// compile: g++ -o data data.cpp -O3 -std=gnu++20 -Wall -Wextra -Wshadow -D_GLIBCXX_ASSERTIONS -ggdb3 -fmax-errors=2 -DLOCAL
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) {_variables(#x);_print(x);}
#else
#define debug(x...)
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define INTMAX (int)(9223372036854775807)
#define INTINF (int)(1152921504606846976)
#define int long long
#define MAXN 200010

vector<int> vis;

struct graph {
    struct node {
        int u, v, w;
    };
    vector<vector<node>> e;
    int n, m;
    bool directed;
    graph(int V, bool D = 0) {
        n = V;
        e.resize(n);
        directed = D;
    }
    void add_edge(int u, int v, int w = 1) {
        e[u].push_back(node{u, v, w});
        ++m;
    }
    void graphviz_dump(string filename = "graph.dot") {
        ofstream gf;
        gf.open(filename);
        gf << (directed ? "digraph" : "graph") << " {\n";
        gf << "    "; rep(i, 0, n) gf << i << " ;"[i==n-1]; gf << endl;
        string notation = directed ? " -> " : " -- ";
        for (auto es: e) {
            for (auto edge: es) {
                if (!directed && edge.v < edge.u) continue;
                gf << "    " << edge.u << notation << edge.v << (directed ? " ;\n" : ";\n");
            }
        }
        gf << "}\n";
    }
    void dfs(int u) {
        vis[u] = 1;
        for (auto edge: e[u]) {
            if (!vis[edge.v]) dfs(edge.v);
        }
    }
};

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int n, m; cin >> n >> m;
    graph g(n);
    rep(i, 0, m) {
        int x, y; cin >> x >> y;
        g.add_edge(x-1, y-1);
        g.add_edge(y-1, x-1);
    }
    g.graphviz_dump();
    vis.assign(n, 0);
    int cnt = 0;
    rep(i, 0, n) {
        if (!vis[i]) {
            g.dfs(i);
            cnt++;
        }
    }
    cout << m - (n - cnt) << endl;

    return 0;
}