Codeforces-Code/A_2023.cpp at master · Nimur-Rashid-Imon66/Codeforces-Code · GitHub

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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
/*                بسم الله الرحمن الرحيم  */
/*                           ربي جدن علما  */
/*                        نيمور رشيدايمون  */


/*                Problem ID : A_2023.cpp */
/*             Date: 2023-12-30 20:54:06 */

#include <bits/stdc++.h>
using namespace std;
void dbg_out(){cerr<<endl;}
template<typename Head , typename... Tail>
void dbg_out(Head H,Tail... T){cerr<<' ' << H; dbg_out(T...);}
#define dbg(...) cerr<<"("<< #__VA_ARGS__ <<"):" , dbg_out(__VA_ARGS__)
#define mod            1000000007
#define nl             endl
#define Nl             endl
#define pb             push_back
#define in             insert
#define ff             first
#define ss             second
#define pii            pair<int,int>
#define pll            pair<ll,ll>
#define vi             vector<int>
#define vl             vector<ll>
#define vii            vector<pair<int,int>>
#define vll            vector<pair<ll,ll>>
#define vc             vector<char>
#define vs             vector<string>
#define vpll           vector< pair<ll,ll> >
#define sei            set<int>
#define usei           unordered_set<int>
#define ses            set<string>
#define sepii          set< pair<int,int> >
#define di             deque<int>
#define sti            stack<int>
#define qi             queue<int>
#define pqi            priority_queue<int>
#define mpii           map<int,int>
#define mpll           map<ll,ll>
#define umii           unordered_map<int,int>
#define testcase       {ll t;cin>>t;while(t--){solve();}}
#define NO             cout << "NO" << endl;
#define Yes            cout << "Yes" << endl;
#define No             cout << "No" << endl;
#define yes            cout << "yes" << endl;
#define no             cout << "no" << endl;
#define YES            cout << "YES" << endl;
#define all(c)         c.begin(), c.end()
#define rall(c)        c.rbegin(), c.rend()
#define min3(a, b, c)  min(c, min(a, b))
#define min4(a, b,c,d) min(d, min(c, min(a, b)))
#define rrep(i, n)     for(int i=n-1;i>=0;i--)
#define rep(i,n)       for(int i=0;i<n;i++)
#define fastIO ios::sync_with_stdio(0); cin.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int dx[8] = {-1, 1, 0, 0,-1,1,-1,1};
int dy[8] = {0, 0, 1, -1,-1,1,1,-1};


void solve()
{
    int n,k;
    cin >> n>>k;
    vi a(n);
    ll ans = 1;
    for (int i = 0; i < n;i++){
        cin>>a[i];
        ans *= a[i];
    }
    if(ans==2023)
    {
        YES
        for(int i = 0; i < k; i++){
            cout<<1<<" ";
        }
        cout<<endl;
        return;
    }
    if(ans==7)
    {
        YES
        cout<<17*17<<" ";
        k--;
       for(int i = 0; i < k; i++){
            cout<<1<<" ";
        }
        cout<<endl;
        return;
    }
    if(ans==17)
    {
        YES
        cout<<7*17<<" ";
        k--;
       for(int i = 0; i < k; i++){
            cout<<1<<" ";
        }
        cout<<endl;
        return;
    }
     if(ans==289)
    {
        YES
        cout<<7<<" ";
        k--;
       for(int i = 0; i < k; i++){
            cout<<1<<" ";
        }
        cout<<endl;
        return;
    }
    if(ans==119)
    {
        YES
        cout<<17<<" ";
        k--;
       for(int i = 0; i < k; i++){
            cout<<1<<" ";
        }
        cout<<endl;
        return;
    }
    if(ans==1)
    {
        YES
        cout<<2023<<" ";
        k--;
       for(int i = 0; i < k; i++){
            cout<<1<<" ";
        }
        cout<<endl;
        return;
    }

    NO


}
int main(){
fastIO
testcase
//solve();
return 0;
}