#include<bits/stdc++.h>
 
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
#define oset tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
 
/*
    order_of_key(k)  :Number of items striclly samller than k
    find_by_order(k) :K-th element in a set (counting from zero)
 
*/
void solve()
{
   int n,q;
   map<int,int>mp;
   oset os;
 
}
 
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
 
    solve();
    return 0;
}

I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgojaW5jbHVkZSA8ZXh0L3BiX2RzL2Fzc29jX2NvbnRhaW5lci5ocHA+CiNpbmNsdWRlIDxleHQvcGJfZHMvdHJlZV9wb2xpY3kuaHBwPgp1c2luZyBuYW1lc3BhY2UgX19nbnVfcGJkczsKCiNkZWZpbmUgb3NldCB0cmVlPGludCwgbnVsbF90eXBlLGxlc3M8aW50PiwgcmJfdHJlZV90YWcsdHJlZV9vcmRlcl9zdGF0aXN0aWNzX25vZGVfdXBkYXRlPgoKCi8qCiAgICBvcmRlcl9vZl9rZXkoaykgIDpOdW1iZXIgb2YgaXRlbXMgc3RyaWNsbHkgc2FtbGxlciB0aGFuIGsKICAgIGZpbmRfYnlfb3JkZXIoaykgOkstdGggZWxlbWVudCBpbiBhIHNldCAoY291bnRpbmcgZnJvbSB6ZXJvKQoKKi8Kdm9pZCBzb2x2ZSgpCnsKICAgaW50IG4scTsKICAgbWFwPGludCxpbnQ+bXA7CiAgIG9zZXQgb3M7Cgp9CgpzaWduZWQgbWFpbigpCnsKICAgIGlvczo6c3luY193aXRoX3N0ZGlvKGZhbHNlKTsKICAgIGNpbi50aWUoTlVMTCk7CgogICAgc29sdmUoKTsKICAgIHJldHVybiAwOwp9