//

/\_/\
//
_____/ o o \
// /~____ == /
// (______)__m_m)
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
priority
#define
#define
#define
#define

<iostream>
<iomanip>
<string>
<vector>
<algorithm>
<cmath>
<deque>
<set>
<map>
<utility>
<sstream>
<stack>
<queue>
<climits>
<limits>
<cstring>
<functional> // for std::greater, used for min
queue

pb push_back
pf push_front
all(c) c.begin(), c.end()
tr(c, it) \
for(typeof(c.begin()) it = c.begin(); it!=c.end(); +

+it)
#define present(container, element)
(find(all(container),element) != container.end())
#define present2(c,x) ((c).find(x) != (c).end()) // For maps
and set
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const long double PI = 3.14159265358979323846264338327950;
const ll MOD = 1000000007;
const double EPS = 1e-9; // a==b is abs(a-b)<EPS, a>=b is a>bEPS, a>b is a>=b+EPS
const int MAX_INT = 2147483647;
using namespace std;

int main()