1823A - A-characteristic - CodeForces Solution

// CF1823A
#include <bits/stdc++.h>

using namespace std;

void solve();

int main(){
    int t;
    cin >> t;
    while (t --){
        solve();
    }
    return 0;
}

void solve(){
    int n, k;
    cin >> n >> k;
    int p = 0;
    while (p <= n){
        if (p * (p - 1) + (n - p) * (n - p - 1) == 2*k){
            break;
        }
        p ++;
    }
    if (p == n + 1){
        cout << "NO\n";
        return;
    }

    vector<int> v(n, -1);
    for (int i = 0; i < p; i ++){
        v[i] = 1;
    }
    cout << "YES\n";
    for (int i : v){
        cout << i << ' ';
    }
    cout << '\n';
    return;
}