#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, const U &b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, const U &b) {
  if (a < b) a = b;
}
template <class 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 T1, class T2>
inline void gn(T1 &x1, T2 &x2) {
  gn(x1), gn(x2);
}
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;
}
vector<int> adj[100100];
int vst[100100], low[100100], st[100100], bel[100100];
int id, top, cnt;
void tarjan(int u, int fa = 0) {
  vst[u] = low[u] = ++id;
  st[++top] = u;
  for (int v : adj[u]) {
    if (!vst[v])
      tarjan(v, u), low[u] = min(low[u], low[v]);
    else if (v != fa)
      low[u] = min(low[u], vst[v]);
  }
  if (vst[u] == low[u]) {
    ++cnt;
    while (1) {
      bel[st[top]] = cnt;
      if (st[top--] == u) break;
    }
  }
}
int flag[100100], sz[100100];
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int u, v;
    gn(u, v);
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  tarjan(1);
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    if (adj[i].size() & 1) ans++;
    if (adj[i].size() >= 3) flag[bel[i]]++;
    sz[bel[i]]++;
  }
  ans /= 2;
  for (int i = 1; i <= cnt; i++)
    if (flag[i] < 2 && sz[i] > 2) ans++;
  cout << ans << ' ' << m << endl;
  return 0;
}
