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.util.*;
  import java.io.*;
  
  public class Basic {
  
  	static Scanner sc = new Scanner(System.in);
  	static PrintWriter pw = new PrintWriter(System.out);
      static int chosen=0;
  	public static void main(String[] args) throws Exception {
  		int t=sc.nextInt();
  		while(t-->0) {
  		   long n=sc.nextInt();
  		   long m=sc.nextInt();
  		   long k=sc.nextInt();
  		   long comp=n*(n-1)/2;
  		   boolean can=true;
  		   if(m>comp || m<n-1)can=false;
  		   else if(k<2)can=false;
  		   
  		   else {
  			  if(k==2&& n!=1)can=false;
  			  else if(k==3) {
  				  if(m<comp)can=false;
  			  }
  		   
  		   
  		
  		}
  		   if(can)pw.println("YES");
  		   else pw.println("NO");
  		}
  		
  
  		pw.close();
  
  	}
  
  	// --------------------stuff ----------------------
  	
  	static class word implements Comparable <word>{
  		String w;
  		int arr[]=new int [5];
  		int tot=0;
  		int totper[]=new int[5];
  
  		public word(String word) {
  			w=word;
  			for(int i=0;i<w.length();i++) {
  				arr[w.charAt(i)-'a']++;
  			}
  			for(int x:arr)tot+=x;
  			for(int i=0;i<5;i++) {
  				
  				totper[i]=tot-arr[i];
  			}
  				
  		}
  
  		public int compareTo(word p) {
  			int mine=arr[chosen]-totper[chosen];
  			int other=p.arr[chosen]-p.totper[chosen];
  			return other-mine;
  		}
  	}
  	static class pair implements Comparable<pair> {
  		
  		int u;
  		int v;
  		int w;
  		int idx;
  
  		public pair(int size, int node,int weight,int i) {
  			this.u = size;
  			this.v = node;
  			this.w=weight;
  			idx=i;
  		}
  
  		public int compareTo(pair p) {
  			return this.w - p.w;// increasing order!!
  
  			// return Double.compare(v*w, p.w*p.v);
  
  		}
  	}
  
  	static class UnionFind {
  		int[] p, rank, setSize;
  		int numSets;
  
  		public UnionFind(int N) {
  			p = new int[numSets = N];
  			rank = new int[N];
  			setSize = new int[N];
  			for (int i = 0; i < N; i++) {
  				p[i] = i;
  				setSize[i] = 1;
  			}
  		}
  
  		public int findSet(int i) {
  			return p[i] == i ? i : (p[i] = findSet(p[i]));
  		}
  
  		public boolean isSameSet(int i, int j) {
  			return findSet(i) == findSet(j);
  		}
  
  		public void unionSet(int i, int j) {
  			if (isSameSet(i, j))
  				return;
  			numSets--;
  			int x = findSet(i), y = findSet(j);
  			if (rank[x] > rank[y]) {
  				p[y] = x;
  				setSize[x] += setSize[y];
  			} else {
  				p[x] = y;
  				setSize[y] += setSize[x];
  				if (rank[x] == rank[y])
  					rank[y]++;
  			}
  		}
  
  		public int numDisjointSets() {
  			return numSets;
  		}
  
  		public int sizeOfSet(int i) {
  			return setSize[findSet(i)];
  		}
  	}
  
  	static class Scanner {
  		StringTokenizer st;
  		BufferedReader br;
  
  		public Scanner(InputStream s) {
  			br = new BufferedReader(new InputStreamReader(s));
  		}
  
  		public Scanner(FileReader r) {
  			br = new BufferedReader(r);
  		}
  
  		public String next() throws IOException {
  			while (st == null || !st.hasMoreTokens())
  				st = new StringTokenizer(br.readLine());
  			return st.nextToken();
  		}
  
  		public int nextInt() throws IOException {
  			return Integer.parseInt(next());
  		}
  
  		public long nextLong() throws IOException {
  			return Long.parseLong(next());
  		}
  
  		public String nextLine() throws IOException {
  			return br.readLine();
  		}
  
  		public double nextDouble() throws IOException {
  			String x = next();
  			StringBuilder sb = new StringBuilder("0");
  			double res = 0, f = 1;
  			boolean dec = false, neg = false;
  			int start = 0;
  			if (x.charAt(0) == '-') {
  				neg = true;
  				start++;
  			}
  			for (int i = start; i < x.length(); i++)
  				if (x.charAt(i) == '.') {
  					res = Long.parseLong(sb.toString());
  					sb = new StringBuilder("0");
  					dec = true;
  				} else {
  					sb.append(x.charAt(i));
  					if (dec)
  						f *= 10;
  				}
  			res += Long.parseLong(sb.toString()) / f;
  			return res * (neg ? -1 : 1);
  		}
  
  		public long[] nextlongArray(int n) throws IOException {
  			long[] a = new long[n];
  			for (int i = 0; i < n; i++)
  				a[i] = nextLong();
  			return a;
  		}
  
  		public Long[] nextLongArray(int n) throws IOException {
  			Long[] a = new Long[n];
  			for (int i = 0; i < n; i++)
  				a[i] = nextLong();
  			return a;
  		}
  
  		public int[] nextIntArray(int n) throws IOException {
  			int[] a = new int[n];
  			for (int i = 0; i < n; i++)
  				a[i] = nextInt();
  			return a;
  		}
  
  		public Integer[] nextIntegerArray(int n) throws IOException {
  			Integer[] a = new Integer[n];
  			for (int i = 0; i < n; i++)
  				a[i] = nextInt();
  			return a;
  		}
  
  		public boolean ready() throws IOException {
  			return br.ready();
  		}
  	}
  
  }