#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <typename T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <typename T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <typename T>
inline void println(T first) {
  print(first), putchar('\n');
}
template <typename T>
inline void printsp(T first) {
  print(first), putchar(' ');
}
template <class T, class T1>
inline void print(T first, T1 second) {
  printsp(first), println(second);
}
template <class T, class T1, class T2>
inline void print(T first, T1 second, T2 z) {
  printsp(first), printsp(second), println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int E, head[100100], to[2 * 300300], nxt[2 * 300300], vst[100100], low[100100],
    bel[100100];
int top, st[100100];
void init(int n) {
  E = 0;
  for (int i = 1; i <= n; i++) head[i] = -1;
}
void add_edge(int u, int v) {
  nxt[E] = head[u];
  to[E] = v;
  head[u] = E++;
  nxt[E] = head[v];
  to[E] = u;
  head[v] = E++;
}
int ind, cnt;
void dfs(int u, int pre = -1) {
  vst[u] = low[u] = ++ind;
  st[++top] = u;
  for (int e = head[u]; e != -1; e = nxt[e]) {
    int v = to[e];
    if (!vst[v])
      dfs(v, e), low[u] = min(low[u], low[v]);
    else if ((e ^ pre) != 1)
      low[u] = min(low[u], vst[v]);
  }
  if (vst[u] == low[u]) {
    ++cnt;
    while (1) {
      bel[st[top]] = cnt;
      if (st[top--] == u) break;
    }
  }
}
pair<int, int> edge[300300];
int deg[100100], sz[100100], cc[100100];
int main() {
  int n, m;
  gn(n, m);
  init(n);
  for (int i = 0; i < m; i++) {
    int u, v;
    gn(u, v);
    add_edge(u, v);
    edge[i] = pair<int, int>(u, v);
    deg[u]++;
    deg[v]++;
  }
  dfs(1);
  for (int i = 1; i <= n; i++) {
    cc[bel[i]]++;
    if (deg[i] > 2) sz[bel[i]]++;
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) ans += deg[i] & 1;
  ans /= 2;
  for (int i = 1; i <= cnt; i++) ans += (sz[i] <= 1 && cc[i] > 1);
  print(ans, m);
  return 0;
}
