#include <bits/stdc++.h> using namespace std; typedef long long ll; const ll mod=1e9+7; const int maxn=5e6+5; const int maxm=1e6; ll sum; int a[maxn]; ll q_sort(int l, int r, int k) { if (l > r) { return 0; } int p = rand() % (r - l + 1) + l; int x = a[p]; swap(a[r], a[p]); int i = l, j = r...