-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathA_2023.cpp
More file actions
81 lines (62 loc) · 1.52 KB
/
A_2023.cpp
File metadata and controls
81 lines (62 loc) · 1.52 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define f first
#define s second
#define min3(a, b, c) min(min(a, b), c)
#define max3(a, b, c) max(max(a, b), c)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
const int INF = 1e9;
//const ll INF = 1e18;
const ll mod = 1000000007;
// const ll mod = 998244353;
void solve(){
int n,k;
cin>>n>>k;
int ans=2023;
for (int i = 0; i < n; i++)
{
int x;
cin>>x;
if(ans%x!=0){
ans=-1;
}else{
ans= ans/x;
}
}
if(ans==-1){
cout<<"NO"<<endl;
}else{
cout<<"YES"<<endl;
cout<<ans<<" ";
for (int i = 0; i < k-1; i++)
{
cout<<1<<" ";
}
cout<<endl;
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
cin>>t;
while(t--)
solve();
return 0;
}