/**
 *    author:  orzvanh14 (  )
 *    created: 23.12.2022 10:08:02
 *    too lazy to update time
**/
// i wants to take ioi
//binhtinhtutinkhongcaycunhungmotkhikhongcontutinnualatuyetvong
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define nn "\n"
#define pi pair<int, int>
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define eb emplace_back
#define pb push_back
#define TASK " "

#define ms(a, x) memset(a, x, sizeof(a))
#define all(a) a.begin(), a.end()
#define All(a, n) a + 1, a + 1 + n

#define LOG 19


const int INF = 1e18;
const int mod = 1e9+7;
const int N = 1e5  + 5;
int MOD = 998244353;
int bit[200000];
struct node{
	int kc, u, hk;
	bool operator<(const node& other) const {
        return kc > other.kc; 
    }
};
struct edge{
	int v, w, h;
};
int n, q;
int a[N];
int st[4 * N];
void nhap(){
    cin >> n >> q;
}
void update(int id, int l, int r, int i, int v){
	if(l > i || i > r) return;
	else if(l == r){
		st[id] = v;
	}
	else{
		int m = l + r >> 1;
		update(id * 2, l, m, i, v);
		update(id * 2 + 1, m + 1, r, i, v);
		st[id] = st[2 * id] + st[2 * id + 1];
	}
}
int get(int id, int l, int r,int u, int v){
	if(l > v || r < u) return 0;
	if( l >= u && r <= v ){
		// doan [l..r] nam trong doan [u...v]
		return st[id];
	} 
	else{
		int m = l + r >> 1;
		return get(id*2, l, m, u, v) + get(id*2+1, m+1, r, u, v);
	}
}
void solve(){
	
}
signed main() {
	// freopen("piggyback.in", "r", stdin);
	// freopen("piggyback.out", "w", stdout);
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
    nhap();
    solve();
	return 0;

}