#include <bits/stdc++.h>   using namespace std;   long long mul(long long a, long long b, long long p = 1000000007) {     return ((a % p) * (b % p)) % p;   }   long long add(long long a, long long b, long long p = 1000000007) {     return (a % p + b % p) % p;   }   void input(long long a[], long long sz) {     for (long long i = 0; i < sz; i++) cin >> a[i];   }   void print(long long a[], long long sz) {     for (long long i = 0; i < sz; i++) {       if (i == sz - 1)         cout << a[i] <<   n ;       else         cout << a[i] <<    ;     }   }   long long maxr(long long a[], long long sz) {     long long ma;     for (long long i = 0; i < sz; i++) {       if (i == 0)         ma = a[i];       else if (a[i] > ma)         ma = a[i];     }     return ma;   }   long long minr(long long a[], long long sz) {     long long mi;     for (long long i = 0; i < sz; i++) {       if (i == 0)         mi = a[i];       else if (a[i] < mi)         mi = a[i];     }     return mi;   }   long long isprm(long long n) {     if (n <= 1) return 0;     if (n <= 3) return 1;     if (n % 2 == 0 || n % 3 == 0) return 0;     for (int i = 5; i * i <= n; i = i + 6)       if (n % i == 0 || n % (i + 2) == 0) return 0;     return 1;   }   long long power(long long x, long long y, long long p = 1000000007) {     long long res = 1;     x = x % p;     while (y > 0) {       if (y & 1) res = (res * x) % p;       y = y >> 1;       x = (x * x) % p;     }     return res;   }   long long modInverse(long long n, long long p = 1000000007) {     return power(n, p - 2, p);   }   long long ncrMod(long long n, long long r, long long p = 1000000007) {     if (r == 0) return 1;     long long fac[n + 1];     fac[0] = 1;     for (long long i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % p;     return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %            p;   }   bool comp(const pair<int, int> &a, const pair<int, int> &b) {     if (a.first == b.first) {       return (a.second > b.second);     }     return (a.first < b.first);   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);     ;     int t;     cin >> t;     while (t--) {       long long n, k;       cin >> n >> k;       long long q = n / k;       long long r = n % k;       if ((r % 2 == 1 && k % 2 == 0) || (r % 2 == 1 && q == 1) || q == 0)         cout <<  NO n ;       else {         cout <<  YES n ;         if (r % 2 == 0) {           cout << q + r <<    ;           for (long long i = 0; i < k - 1; i++) cout << q <<    ;           cout <<   n ;         } else {           cout << q + r <<    ;           for (long long i = 0; i < k - 1; i++) {             if (i % 2 == 0)               cout << q - 1 <<    ;             else               cout << q + 1 <<    ;           }           cout <<   n ;         }       }     }     return 0;   }   