2023

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
 
#define ll long long
#define pb push_back
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define dbg(x) cout << #x << " = " << x << "\n";
#define all(x) (x).begin(),(x).end()
#define ff first
#define ss second
#define srt(s) sort(all(s))
#define S size()
#define f(i,m,n) for(ll i=m;i<n;i++)
#define nf(i,b,a); for(ll i=(b);i>=(a);i--)
#define llv(a,n) vector<ll> a(n,0); for(ll i=0;i<n;i++) cin>>a[i];
#define test(v) for(auto i:v) cout<<i<<' '; cout<<endl;
 
//think again
 
void solve(){
    ll a,b; cin>>a>>b; llv(v,a);
    f(i,0,a){
        if(v[i]>289 and v[i]!=2023){
            cout<<"NO"<<endl; return;
        }
    }
    ll cnt=1; f(i,0,a)cnt*=v[i];
    if(2023%cnt!=0){
        cout<<"NO"<<endl; return;
    }else{
        cout<<"YES"<<endl; f(i,0,b-1)cout<<1<<" "; cout<<2023/cnt<<endl; return;
    }
 
}
 
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    ll t;cin>>t;
    while(t--)
       solve();
    return 0;
}