12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define inl_force __attribute__((always_inline)) inline
typedef long long ll;

template <typename Tp>
struct SgT {
    int n;
    vector<Tp> t, lazy;
    inl_force void push_up(int i) {
        略;
    }
    inl_force void push_down(int i, int l, int r, int mid) {
        略;
    }
    void build(int i, int l, int r, const vector<Tp>& a) {
        略;
    }
    inl_force void operator = (const vector<Tp>& a) {
        略;
    }
    void modify(int i, int l, int r, int ql, int qr, ll x) {
        略;
    }
    Tp query(int i, int l, int r, int ql, int qr) {
        略;
    }
};
SgT<ll> sgt;
vector<ll> a;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, q;
    cin >> n >> q;
    a.resize(n + 1);
    for (int i = 1; i <= n; i ++) {
        cin >> a[i];
    }
    sgt = a;
    while (q --) {
        略;
        }
    }
    return 0;
}