#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace std;

using namespace __gnu_pbds;

typedef long long ll ;

typedef vector<ll> vl;

#define speed cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);

#define phi 1.618

#define ff first

#define ss second

#define mp make_pair

#define line cout<<endl;

#define pb push_back

#define Endl "\n"

#define forin(arr,n) for(ll i=0;i<n;i++) cin>>arr[i];

#define no cout<<"NO"<<endl;

#define yes cout<<"YES"<<endl;

#define cc ll test;cin>>test;while(test--)

#define all(V) (V).begin(),(V).end()

#define srt(V) sort(all(V))

#define srtGreat(V) sort(all(V),greater<ll>())

#define printv(v) for(ll i=0;i<ll(v.size());i++){cout<<v[i]<<" ";} line;

ll power(ll x,ll y,ll mod)

}

#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>

ll solve()

}

int main()

}