#include #define rep(i, n) for (ll i = 0; i < ll(n); ++i) #define rep2(i, s, n) for (ll i = s; i < ll(n); ++i) #define per(i, n) for (ll i = ll(n) - 1; i >= 0; --i) #define per2(i, s, n) for (ll i = ll(n) - 1; i >= s; --i) #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define fix(n) cout << fixed << setprecision(n); using namespace std; using ll = long long; using ld = long double; using V = vector; using P = pair; using M = map; using S = set; using Q = queue; using PQ = priority_queue; using VV = vector; using VVV = vector; using VVVV = vector; using VVVVV = vector; using VVVVVV = vector; using VS = vector; using VP = vector

; using VB = vector; template using PQG = priority_queue, greater>; template constexpr bool chmin(S &a, T b) { if (a > b) { a = b; return true; } return false; } template constexpr bool chmax(S &a, T b) { if (a < b) { a = b; return true; } return false; } template void Vin(vector &v) { for (T &a : v) cin >> a; } template void VVin(vector> &v) { for (int i = 0; i < v.size(); ++i) Vin(v[i]); } template void Vout(vector &v) { for (T &a : v) cout << a << " "; cout << endl; } template void Voutl(vector &v) { for (T &a : v) cout << a << endl; } constexpr ll power(ll a, ll b) { ll res = 1; while (b) { if (b & 1) res *= a; a *= a; b >>= 1; } return res; } constexpr ll mpower(ll a, ll b, const ll &m) { a %= m; ll res = 1; while (b) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } constexpr bool in_field(int i, int j, int h, int w) { return i >= 0 && j >= 0 && i < h && j < w; } const string yes[] = {"no", "yes"}; const string Yes[] = {"No", "Yes"}; const string YES[] = {"NO", "YES"}; const int H[] = {1, 0, -1, 0}; const int W[] = {0, 1, 0, -1}; constexpr ll mod = 998244353; constexpr ll MOD = 1000000007; constexpr ll INF = 1LL << 60; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << "No\n"; }