# Diameter of Graph solution codeforces

CQXYM wants to create a connected undirected graph with nn nodes and mm edges, and the diameter of the graph must be strictly less than k1k−1. Also, CQXYM doesn’t want a graph that contains self-loops or multiple edges (i.e. each edge connects two different vertices and between each pair of vertices there is at most one edge).

The diameter of a graph is the maximum distance between any two nodes.

The distance between two nodes is the minimum number of the edges on the path which endpoints are the two nodes.

CQXYM wonders whether it is possible to create such a graph.

## Diameter of Graph solution codeforces

Input

The input consists of multiple test cases.

The first line contains an integer t(1t105)t(1≤t≤105) — the number of test cases. The description of the test cases follows.

Only one line of each test case contains three integers n(1n109)n(1≤n≤109)mmkk (0m,k109)(0≤m,k≤109).

Output

For each test case, print YES if it is possible to create the graph, or print NO if it is impossible. You can print each letter in any case (upper or lower).

### Diameter of Graph solution codeforces

Example
input

Copy
5
1 0 3
4 5 3
4 6 3
5 4 1
2 1 1

output

Copy
YES
NO
YES
NO
NO

Note

In the first test case, the graph’s diameter equal to 0.

In the second test case, the graph’s diameter can only be 2.

In the third test case, the graph’s diameter can only be 1.