#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr)
#define ll long long
#define fi first
#define se second
#define int long long
#define no "NO\n"
#define yes "YES\n"
#define pb push_back
#define endl "\n"
#define dbg(x...) do{cout<<#x<<" -> ";err(x);}while (0)
void err() { cout << '\n'; }

template<class T, class... Ts>
void err(T arg, Ts... args) {
    cout << arg << ' ';
    err(args...);
}

const int N = 1e3 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1.0);
int n,m;
int a[N];
int check(int x){
	vector<int>e;
	for(int i=1;i<=n;i++){
		int cnt=0,ans = a[i];
		while(ans>x){
			if(x-ans/2+1>=ans-x){
				cnt+=ans-x;
				ans = x;
				break;
			}else{
				ans/=2;
				cnt++;
			}
		}
		cnt+= x-ans;
		e.push_back(cnt);
	}
	sort(e.begin(),e.end());
	int res=0;
	for(int i=0;i<n-m;i++){
		res+=e[i];
	}
	return res;
}

void  solve(){
	 int n,k;
	 cin >> n >> k;
	 if(n==1) cout << yes;
	 else if(k==1) cout << no;
	 else if(k%2==0) cout << yes;
	 else if(k%2==1){
	 	int x = k*k-1;
	 	if(n<=x)cout << yes;
	 	else cout << no;
	 }
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(nullptr),cout.tie(nullptr);
  	int T=1;
  	cin >>T;
  	while(T--) solve();
    return 0;
}