#include <iostream>

#include <cstring>

#include <cstdio>

#include <queue>

using namespace std;

const int maxnode = , maxedge = , INF = ;

int n, m, s, t, head[maxnode], cnt = , Depth[maxnode], Ans;

struct Edge {

    int nxt, v, w;

}ed[maxedge];

inline void addedge(int u, int v, int w) {

    ed[++cnt].nxt = head[u];

    ed[cnt].v = v, ed[cnt].w = w;

    head[u] = cnt;

}

inline bool BFS() {

    queue <int> Q;

    memset(Depth, , sizeof(Depth));

    Depth[s] = , Q.push(s);

    int u;

    while (!Q.empty()) {

        u = Q.front();

        Q.pop();

        for(int i=head[u]; i; i=ed[i].nxt) {

            if(Depth[ed[i].v] ==  && ed[i].w > ) {

                Depth[ed[i].v] = Depth[u] + ;

                Q.push(ed[i].v);

                if(ed[i].v == t) return true;

            }

        }

    }

    return false;

}

inline int Dinic(int u, int cap) {

    if(u == t) return cap;

    int delta;

    for(int i=head[u]; i; i=ed[i].nxt) {

        if(ed[i].w >  && Depth[ed[i].v] == Depth[u] + ) {

            delta = Dinic(ed[i].v, min(cap, ed[i].w));

            if(delta > ) {

                ed[i].w -= delta;

                ed[i^].w += delta;

                return delta;

            }

        }

    }

    return ;

}

int main() {

    scanf("%d%d", &n, &m);

    s = , t = n+;

    for(int i=; i<=m; i++) addedge(s, i, ), addedge(i, s, );

    for(int i=m+; i<=n; i++) addedge(i, t, ), addedge(t, i, );

    static int x, y;

    while (scanf("%d%d", &x, &y) == ) addedge(x, y, ), addedge(y, x, );

    while (BFS()) Ans += Dinic(s, INF);

    printf("%d", Ans);

}