/*

 ∧＿∧
( ･ω･｡)つ━☆・*。
⊂　 ノ 　　　・゜
しーＪ　　 Accepted

*/



// #pragma GCC optimize("O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define all(x) begin(x), end(x)
#define x first
#define y second
#define int long long

using namespace std;
using namespace __gnu_pbds;

typedef long double ld;
template<typename T>
using kawaii_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ld PI = atan2(0, -1);

void seriy() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(14);
    #ifdef _offline
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
}

const int MAXN = 1e6 + 10;
const int MAXM = 600;
const int INF = 1e18;
const int BASE = 47;
const int MOD = 1e9 + 7;
const int MAXLOG = 21;

mt19937 rr(47);

struct treap {
    treap *left = nullptr;
    treap *right = nullptr;
    int sum, prior, sz;

    treap(int sum) {
        this->sum = sum;
        this->prior = rr();
        this->sz = 1;
    }
};

int get_size(treap *&root) {
    return ((root == nullptr) ? 0 : root->sz);
}

int get_val(treap *&root) {
    return ((root == nullptr) ? 0 : root->sum);
}

void update(treap *&root) {
    if(root == nullptr) return;
    if(root->left == nullptr && root->right == nullptr) {
        return;
    }
    int add_l = 0;
    int add_r = 0;

    int sum_l = 0;
    int sum_r = 0;

    if(root->left != nullptr) {
        add_l = root->left->sz;
        sum_l = root->left->sum;
    }
    if(root->right != nullptr) {
        add_r = root->right->sz;
        sum_r = root->right->sum;
    }
    root->sz = add_l + add_r + 1;
    root->sum = sum_l + sum_r;
}

void split(treap *&root, treap *&left, treap *&right, int key) {
    if(root == nullptr) {
        left = nullptr;
        right = nullptr;
        return;
    }
    int root_key = get_size(root->left);
    if(key > root_key) {
        split(root->right, root->right, right, key);
        left = root;
    }
    else {
        split(root->left, left, root->left, key);
        right = root;
    }
    update(root);
}

treap* merge(treap *&left, treap *&right) {
    if(left == nullptr) {
        return right;
    }
    if(right == nullptr) {
        return left;
    }
    if(left->prior > right->prior) {
        left->right = merge(left->right, right);
        update(left);
        update(right);
        return left;
    }
    else {
        right->left = merge(left, right->left);
        update(right);
        update(left);
        return right;
    }
}

void insert(treap *&root, int pos, int val) {
    treap *left = nullptr, *right = nullptr;
    split(root, left, right, pos);
    treap *nw = new treap(val * val);
    left = merge(left, nw);
    update(left);
    // cerr << get_val(left) << '\n';
    left = merge(left, right);
    update(left);
    // cerr << get_val(left) << '\n';
    root = left;
}

treap* erase(treap *root, int pos) {
    if(pos < root->sz) {
        erase(root->left, pos);
    }
    else if(pos > root->sz) {
        erase(root->right, pos);
    }
    else {
        root = merge(root->left, root->right);
        update(root);
    }
}

int get(treap *root, int pos) {
    if(pos < root->sz) {
        return get(root->left, pos);
    }
    else if(pos > root->sz) {
        return get(root->right, pos);
    }
    else {
        return root->sum;
    }
}

signed main() {
    seriy();
    int n, p;
    cin >> n >> p;
    vector<int> a(n);
    treap *root = nullptr;
    insert(root, 0, 2);
    insert(root, 0, 3);
    treap *left = nullptr, *right = nullptr;
    // split(root, left, right, 0);
    // cerr << root->sum << '\n';
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        // insert(root, i, a[i]);
        // cerr << root->sz << '\n';
    }
    // int q;
    // cin >> q;
    // while(q--) {
    //     int t, pos;
    //     cin >> t >> pos;
    //     pos--;
        // int w = get(root, pos);
        // erase(root, pos);
        // insert(root, pos, (w + 1) / 2);
        // insert(root, pos, w / 2);
        // cout << root->sum << '\n';
    // }
    return 0;
}