description: CQXYM wants to create a connected undirected graph with n nodes and m edges, and the diameter of the graph must be strictly less than k-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.
  
  Input
  
  The input consists of multiple test cases. 
  
  The first line contains an integer t (1 ≤ t ≤ 10^5) — the number of test cases. The description of the test cases follows.
  
  Only one line of each test case contains three integers n(1 ≤ n ≤ 10^9), m, k (0 ≤ m,k ≤ 10^9).
  
  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).
  
  Example
  
  Input
  
  
  5
  1 0 3
  4 5 3
  4 6 3
  5 4 1
  2 1 1
  
  
  Output
  
  
  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.
solution: import java.io.ByteArrayInputStream;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.PrintWriter;
  import java.util.ArrayList;
  import java.util.Arrays;
  import java.util.InputMismatchException;
  import java.util.List;
  
  public class Main {
  
  	private static final String NO = "No";
  	private static final String YES = "Yes";
  	InputStream is;
  	PrintWriter out;
  	String INPUT = "";
  
  	private static final long MOD = (long) (1e9 + 7);
  	private static final int MAXN = (int) (2e5 + 1);
  
  	void solve() {
  		int T = ni();
  		for (int i = 0; i < T; i++)
  			solve(i);
  	}
  
  	void solve(int p) {
  		long n = nl();
  		long m = nl();
  		long k = nl();
  		k -= 2;
  		if (m < n - 1) {// not a tree
  			out.println("NO");
  		} else if (m <= n * (n - 1) / 2) {
  			if (k < 0)
  				out.println("NO");
  			else if (k == 0) {
  				if (n == 1)
  					out.println("YES");
  				else
  					out.println("NO");
  			} else if (k == 1) {
  				if (m == n * (n - 1) / 2)
  					out.println("YES");
  				else
  					out.println("NO");
  			} else {
  				out.println("YES");
  			}
  		} else {// have self loop...
  			out.println("NO");
  		}
  	}
  
  	// a^b
  	long power(long a, long b) {
  		long x = 1, y = a;
  		while (b > 0) {
  			if (b % 2 != 0) {
  				x = (x * y) % MOD;
  			}
  			y = (y * y) % MOD;
  			b /= 2;
  		}
  		return x % MOD;
  	}
  
  	private long gcd(long a, long b) {
  		while (a != 0) {
  			long tmp = b % a;
  			b = a;
  			a = tmp;
  		}
  		return b;
  	}
  
  	void run() throws Exception {
  		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
  		out = new PrintWriter(System.out);
  
  		long s = System.currentTimeMillis();
  		solve();
  		out.flush();
  		if (!INPUT.isEmpty())
  			tr(System.currentTimeMillis() - s + "ms");
  	}
  
  	public static void main(String[] args) throws Exception {
  		new Main().run();
  	}
  
  	private byte[] inbuf = new byte[1024];
  	public int lenbuf = 0, ptrbuf = 0;
  
  	private int readByte() {
  		if (lenbuf == -1)
  			throw new InputMismatchException();
  		if (ptrbuf >= lenbuf) {
  			ptrbuf = 0;
  			try {
  				lenbuf = is.read(inbuf);
  			} catch (IOException e) {
  				throw new InputMismatchException();
  			}
  			if (lenbuf <= 0)
  				return -1;
  		}
  		return inbuf[ptrbuf++];
  	}
  
  	private boolean isSpaceChar(int c) {
  		return !(c >= 33 && c <= 126);
  	}
  
  	private int skip() {
  		int b;
  		while ((b = readByte()) != -1 && isSpaceChar(b))
  			;
  		return b;
  	}
  
  	private double nd() {
  		return Double.parseDouble(ns());
  	}
  
  	private char nc() {
  		return (char) skip();
  	}
  
  	private String ns() {
  		int b = skip();
  		StringBuilder sb = new StringBuilder();
  		while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != '
  									// ')
  			sb.appendCodePoint(b);
  			b = readByte();
  		}
  		return sb.toString();
  	}
  
  	private char[] ns(int n) {
  		char[] buf = new char[n];
  		int b = skip(), p = 0;
  		while (p < n) {
  			if (!(isSpaceChar(b)))
  				buf[p++] = (char) b;
  			b = readByte();
  		}
  		return n == p ? buf : Arrays.copyOf(buf, p);
  	}
  
  	private char[][] nm(int n, int m) {
  		char[][] map = new char[n][];
  		for (int i = 0; i < n; i++)
  			map[i] = ns(m);
  		return map;
  	}
  
  	private int[] na(int n) {
  		int[] a = new int[n];
  		for (int i = 0; i < n; i++)
  			a[i] = ni();
  		return a;
  	}
  
  	private List<Integer> na2(int n) {
  		List<Integer> a = new ArrayList<Integer>();
  		for (int i = 0; i < n; i++)
  			a.add(ni());
  		return a;
  	}
  
  	private int[][] na(int n, int m) {
  		int[][] a = new int[n][];
  		for (int i = 0; i < n; i++)
  			a[i] = na(m);
  		return a;
  	}
  
  	private int ni() {
  		int num = 0, b;
  		boolean minus = false;
  		while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
  			;
  		if (b == '-') {
  			minus = true;
  			b = readByte();
  		}
  
  		while (true) {
  			if (b >= '0' && b <= '9') {
  				num = num * 10 + (b - '0');
  			} else {
  				return minus ? -num : num;
  			}
  			b = readByte();
  		}
  	}
  
  	private long[] nl(int n) {
  		long[] a = new long[n];
  		for (int i = 0; i < n; i++)
  			a[i] = nl();
  		return a;
  	}
  
  	private long[][] nl(int n, int m) {
  		long[][] a = new long[n][];
  		for (int i = 0; i < n; i++)
  			a[i] = nl(m);
  		return a;
  	}
  
  	private long nl() {
  		long num = 0;
  		int b;
  		boolean minus = false;
  		while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
  			;
  		if (b == '-') {
  			minus = true;
  			b = readByte();
  		}
  
  		while (true) {
  			if (b >= '0' && b <= '9') {
  				num = num * 10 + (b - '0');
  			} else {
  				return minus ? -num : num;
  			}
  			b = readByte();
  		}
  	}
  
  	private static void tr(Object... o) {
  		System.out.println(Arrays.deepToString(o));
  	}
  
  }
  