#include <bits/stdc++.h>

//#pragma GCC optimize("Ofast,unroll-loops")

#define isPbdsFile

#ifdef isPbdsFile

#include <bits/extc++.h>

#else

#include <ext/pb_ds/priority_queue.hpp>
#include <ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/list_update_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/exception.hpp>
#include <ext/rope>

#endif

using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> tii;
typedef tuple<ll, ll, ll> tll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef __int128 i128;
#define hash1 unordered_map
#define hash2 gp_hash_table
#define hash3 cc_hash_table
#define stdHeap std::priority_queue
#define pbdsHeap __gnu_pbds::priority_queue
#define sortArr(a, n) sort(a+1,a+n+1)
#define all(v) v.begin(),v.end()
#define yes cout<<"YES"
#define no cout<<"NO"
#define Spider ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define MyFile freopen("..\\input.txt", "r", stdin),freopen("..\\output.txt", "w", stdout);
#define forn(i, a, b) for(int i = a; i <= b; i++)
#define forv(i, a, b) for(int i=a;i>=b;i--)
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)
#define endl '\n'
//用于Miller-Rabin
[[maybe_unused]] static int Prime_Number[13] = {0, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37};

template <typename T>
int disc(T* a, int n)
{
    return unique(a + 1, a + n + 1) - (a + 1);
}

template <typename T>
T lowBit(T x)
{
    return x & -x;
}

template <typename T>
T Rand(T l, T r)
{
    static mt19937 Rand(time(nullptr));
    uniform_int_distribution<T> dis(l, r);
    return dis(Rand);
}

template <typename T1, typename T2>
T1 modt(T1 a, T2 b)
{
    return (a % b + b) % b;
}

template <typename T1, typename T2, typename T3>
T1 qPow(T1 a, T2 b, T3 c)
{
    a %= c;
    T1 ans = 1;
    for (; b; b >>= 1, (a *= a) %= c)if (b & 1)(ans *= a) %= c;
    return modt(ans, c);
}

template <typename T>
void read(T& x)
{
    x = 0;
    T sign = 1;
    char ch = getchar();
    while (!isdigit(ch))
    {
        if (ch == '-')sign = -1;
        ch = getchar();
    }
    while (isdigit(ch))
    {
        x = (x << 3) + (x << 1) + (ch ^ 48);
        ch = getchar();
    }
    x *= sign;
}

template <typename T, typename... U>
void read(T& x, U&... y)
{
    read(x);
    read(y...);
}

template <typename T>
void write(T x)
{
    if (typeid(x) == typeid(char))return;
    if (x < 0)x = -x, putchar('-');
    if (x > 9)write(x / 10);
    putchar(x % 10 ^ 48);
}

template <typename C, typename T, typename... U>
void write(C c, T x, U... y)
{
    write(x), putchar(c);
    write(c, y...);
}


template <typename T11, typename T22, typename T33>
struct T3
{
    T11 one;
    T22 tow;
    T33 three;

    bool operator<(const T3 other) const
    {
        if (one == other.one)
        {
            if (tow == other.tow)return three < other.three;
            return tow < other.tow;
        }
        return one < other.one;
    }

    T3() { one = tow = three = 0; }

    T3(T11 one, T22 tow, T33 three) : one(one), tow(tow), three(three)
    {
    }
};

template <typename T1, typename T2>
void uMax(T1& x, T2 y)
{
    if (x < y)x = y;
}

template <typename T1, typename T2>
void uMin(T1& x, T2 y)
{
    if (x > y)x = y;
}

constexpr int N = 1e5 + 10;
int n, m;
int pos[N], s[N], e[N];
int blockSize, blockCnt;
int a[N];
T3<int, int, int> qu[N];
int last[N];
int pre[N];
int all[N]; //离线有关的查询
int sca[N]; //散块更新的查询编号
int tmp[N]; //临时计算整块贡献
//由第id个块更新每个修改的时间last
inline void update(const int id)
{
    const int L = s[id], R = e[id];
    //先考虑查询包括的整块能更新的时间末尾点
    int mx = 0;
    forn(i, L, R)uMax(mx, tmp[i] = a[i]); //最大容量
    int r = 0;
    int add = 0; //整个块的addSize
    //考虑加入/删除第curr个操作的影响
    auto updateOpt = [&](const int curr, const int val)
    {
        auto [l,r,_] = qu[curr];
        if (l > R or r < L)return; //不在里面不考虑
        if (l <= L and R <= r)
        {
            add += val; //整块打增加标记
            return;
        }
        //散块暴力修改,重算最大容量
        mx = 0;
        forn(i, L, R)
        {
            if (l <= i and i <= r)tmp[i] -= val;
            uMax(mx, tmp[i]);
        }
    };
    forn(l, 1, m)
    {
        auto [queryL,queryR,_] = qu[l];
        while (r <= m and mx >= add)updateOpt(++r, 1); //不断加入新操作直到l所指操作对应的x被弹出
        if (queryL <= L and R <= queryR)uMax(last[l], r); //如果查询包括整块,就可以用整块的l最后存在时间更新last了
        updateOpt(l, -1);
    }
    //考虑查询包括的散块的last周期
    //散块------一堆整块------散块-----一堆整块.... 抽象模型
    forn(i, 1, m)pre[i] = 0; //用于作为前缀和做差优化找到一堆整块整体更新的addSize
    int siz = 0, pointIdx = 0;
    forn(i, 1, m)
    {
        const auto [l,r,_] = qu[i];
        if (l > R or r < L)continue; //没有交集跳过这个查询
        all[++siz] = i;
        if (l <= L and R <= r)
        {
            //整块查询,addSize+1
            pre[siz] = pre[siz - 1] + 1; //前缀的addSize +1
        }
        else
        {
            //散块add标记没变化,但需要记录需要处理的散块查询
            pre[siz] = pre[siz - 1];
            sca[++pointIdx] = siz;
        }
    }
    //最后有可能这个操作一直都在,可以视为第m+1次从操作时才弹出
    all[siz + 1] = m + 1;
    int maxAdd;
    //散块单点修改
    auto Update = [&](const int i, const int queryId, const bool isFirst, const int val)
    {
        auto [l,r,_] = qu[all[sca[queryId]]];
        if (!isFirst)maxAdd += (pre[sca[queryId]] - pre[sca[queryId - 1]]) * val; //散块之前的整块一并计入懒标记
        if (l <= i and i <= r)maxAdd += val;
    };
    //删除左端点queryId,会失去下一个散块和当前散块之间的贡献
    auto Del = [&](const int i, const int queryId)
    {
        auto [l,r,_] = qu[all[sca[queryId]]];
        maxAdd -= pre[sca[queryId + 1]] - pre[sca[queryId]];
        if (l <= i and i <= r)maxAdd--;
    };
    //暴力考虑单点last
    forn(i, L, R)
    {
        maxAdd = 0;
        mx = a[i];
        //处理所有散块查询
        r = 0;
        forn(l, 1, pointIdx)
        {
            while (r < pointIdx and mx >= maxAdd)++r, Update(i, r, l == r, 1); //加入这个散块直到不能再加入
            if (auto [queryl,queryr,_] = qu[all[sca[l]]]; queryl <= i and i <= queryr)
            {
                //对这组查询有影响
                int idx = all[sca[l]];
                if (mx < maxAdd)
                {
                    Update(i, r, l == r, -1), r--; //最后一次操作导致恰好不满足,回退就满足了
                    int need = mx - maxAdd + 1; //还需要多少次加入才能弹出所有点,刚好填满以后再加一个点就能弹出队首l对应的x
                    uMax(last[idx], all[min(sca[r] + need, siz + 1)]); //更新是哪个操作是最后一次单点弹出操作
                    r++, Update(i, r, l == r, 1); //移动到第一个恰好不满足点,至多移动一位
                }
                else
                {
                    //mx>=maxAdd
                    //显然如果还剩余整块操作,last要么就是在整块操作里面,要么就是结束
                    int need = mx - maxAdd + 1; //还需要多少次加入才能弹出所有点,刚好填满以后再加一个点就能弹出队首l对应的x
                    uMax(last[idx], all[min(sca[r] + need, siz + 1)]); //更新是哪个操作是最后一次单点弹出操作
                }
            }
            Del(i, l);
        }
    }
}

int Cnt[N]; //桶计算元素个数
vector<int> child[N]; //离线扫描线
inline void solve()
{
    // MyFile
    cin >> n >> m;
    blockSize = sqrt(n);
    blockCnt = (n + blockSize - 1) / blockSize;
    forn(i, 1, n)cin >> a[i], pos[i] = (i - 1) / blockSize + 1;
    forn(i, 1, blockCnt)s[i] = (i - 1) * blockSize + 1, e[i] = i * blockSize;
    e[blockCnt] = n;
    forn(i, 1, m)cin >> qu[i].one >> qu[i].tow >> qu[i].three;
    forn(i, 1, blockCnt)update(i);
    forn(i, 1, m)child[last[i]].push_back(i);
    int res = 0;
    forn(i, 1, m)
    {
        res += ++Cnt[qu[i].three] == 1;
        for (int j : child[i])res -= --Cnt[qu[j].three] == 0;
        cout << res << endl;
    }
}

signed int main()
{
    Spider
    //------------------------------------------------------
    int test = 1;
    //    read(test);
    // cin >> test;
    forn(i, 1, test)solve();
    //    while (cin >> n, n)solve();
    //    while (cin >> test)solve();
}