CF1065B.Vasya and Isolated Vertices

Vasya has got an undirected graph consisting of $n$ vertices and $m$ edges. This graph doesn't contain any self-loops or multiple edges. Self-loop is an edge connecting a vertex to itself. Multiple edges are a pair of edges such that they connect the same pair of vertices. Since the graph is undirected, the pair of edges $(1, 2)$ and $(2, 1)$ is considered to be multiple edges. Isolated vertex of the graph is a vertex such that there is no edge connecting this vertex to any other vertex.

Vasya wants to know the minimum and maximum possible number of isolated vertices in an undirected graph consisting of $n$ vertices and $m$ edges.

瓦西娅得到了一个包含 $n$ 个顶点和 $m$ 条边的无向图。该图不包含任何自环或重边。自环是指连接某个顶点到其自身的边；重边是指连接同一对顶点的两条边。由于图是无向的，因此边 $(1, 2)$ 和 $(2, 1)$ 被视为重边。图中的孤立顶点是指不与任何其他顶点相连的顶点。

瓦西娅想知道：在包含 $n$ 个顶点和 $m$ 条边的无向图中，孤立顶点数的最小可能值和最大可能值分别是多少？

The only line contains two integers $n$ and $m~(1 \le n \le 10^5, 0 \le m \le \frac{n (n - 1)}{2})$.

It is guaranteed that there exists a graph without any self-loops or multiple edges with such number of vertices and edges.

唯一的一行包含两个整数 $n$ 和 $m~(1 \le n \le 10^5, 0 \le m \le \frac{n (n - 1)}{2})$。

保证存在一个不含自环和重边的图，其顶点数和边数恰好分别为 $n$ 和 $m$。

In the only line print two numbers $min$ and $max$ — the minimum and maximum number of isolated vertices, respectively.

在唯一的一行中输出两个数 $min$ 和 $max$ —— 分别为孤立顶点的最小数量和最大数量。

In the first example it is possible to construct a graph with $0$ isolated vertices: for example, it should contain edges $(1, 2)$ and $(3, 4)$. To get one isolated vertex, we may construct a graph with edges $(1, 2)$ and $(1, 3)$.

In the second example the graph will always contain exactly one isolated vertex.

在第一个例子中，可以构造一个包含 $0$ 个孤立顶点的图：例如，该图应包含边 $(1, 2)$ 和 $(3, 4)$。要得到一个孤立顶点，我们可以构造一个包含边 $(1, 2)$ 和 $(1, 3)$ 的图。

在第二个例子中，该图将始终恰好包含一个孤立顶点。