Problem: Berland is very concerned with privacy, so almost all plans and blueprints are secret. However, a spy of the neighboring state managed to steal the Bertown subway scheme.

The Bertown Subway has n stations, numbered from 1 to n, and m bidirectional tunnels connecting them. All Bertown Subway consists of lines. To be more precise, there are two types of lines: circular and radial.

A radial line is a sequence of stations v1, ..., vk (k > 1), where stations vi and vi + 1 (i < k) are connected by a tunnel and no station occurs in the line more than once (vi ≠ vj for i ≠ j).

A loop line is a series of stations, v1, ..., vk (k > 2), where stations vi и vi + 1 are connected by a tunnel. In addition, stations v1 and vk are also connected by a tunnel. No station is occurs in the loop line more than once.

Note that a single station can be passed by any number of lines.

According to Berland standards, there can't be more than one tunnel between two stations and each tunnel belongs to exactly one line. Naturally, each line has at least one tunnel. Between any two stations there is the way along the subway tunnels. In addition, in terms of graph theory, a subway is a vertex cactus: if we consider the subway as a graph in which the stations are the vertexes and the edges are tunnels, then each vertex lies on no more than one simple cycle.

Unfortunately, scheme, stolen by the spy, had only the stations and the tunnels. It was impossible to determine to which line every tunnel corresponds. But to sabotage successfully, the spy needs to know what minimum and maximum number of lines may be in the Bertown subway.

Help him!

Input

The first line contains two integers n and m (1 ≤ n ≤ 105, 0 ≤ m ≤ 3·105) — the number of stations and the number of tunnels, correspondingly.

Each of the next m lines contain two integers — the numbers of stations connected by the corresponding tunnel. The stations are numbered with integers from 1 to n.

It is guaranteed that the graph that corresponds to the subway has no multiple edges or loops, it is connected and it is a vertex cactus.

Output

Print two numbers — the minimum and maximum number of lines correspondingly.

Examples

Input

3 3
1 2
2 3
3 1


Output

1 3


Input

8 8
1 2
2 3
3 4
4 5
6 4
4 7
7 2
2 8


Output

2 8


Input

6 6
1 2
2 3
2 5
5 6
3 4
3 5


Output

3 6

Note

The subway scheme with minimum possible number of lines for the second sample is: 

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200008;
int n, m, f[maxn], in[maxn], huan[maxn], tot;
int ans, d[maxn], fa[maxn];
struct Tedge {
  int start[maxn], tot;
  struct arr {
    int a, next;
  } e[maxn << 2];
  void clear() {
    tot = 1;
    memset(start, 0, sizeof(start));
  }
  void add(int x, int y) {
    e[++tot].a = y;
    e[tot].next = start[x];
    start[x] = tot;
    e[++tot].a = x;
    e[tot].next = start[y];
    start[y] = tot;
  }
} E;
struct Tprogram {
  void open() {
    freopen("1.in", "r", stdin);
    freopen("1.out", "w", stdout);
  }
  void close() {}
  void init() {
    scanf("%d%d", &n, &m);
    int x, y;
    E.clear();
    for (int i = 1; i <= m; i++) {
      scanf("%d%d", &x, &y);
      E.add(x, y);
      d[x]++;
      d[y]++;
    }
    for (int i = 1; i <= n; i++) ans += (d[i] & 1);
    ans >>= 1;
  }
  void dfs(int u) {
    in[u] = ++tot;
    for (int i = E.start[u], v; v = E.e[i].a, i; i = E.e[i].next)
      if (!in[v]) {
        fa[v] = u;
        dfs(v);
      } else if (in[v] > in[u])
        huan[u] = v;
    if (huan[u]) {
      for (int v = huan[u]; v != u; v = fa[v])
        if (d[v] > 2) return;
      ans++;
    }
  }
  void work() {
    int p = 0;
    for (int i = 1; i <= n; i++)
      if (d[i] > d[p]) p = i;
    dfs(p);
    printf("%d %d\n", ans, m);
  }
} Program;
int main() {
  Program.init();
  Program.work();
  return 0;
}