KfB6kn - Online C++0x Compiler & Debugging Tool

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define ld long double
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define nn '\n'
#define pi pair<int, int>
#define unmp unordered_map
#define uns unordered_set
#define lb lower_bound
#define ub upper_bound
#define pq priority_queue
#define TASK " "

const int INF = 1e18;
const int mod = 1e9+7;
const int N = 5*1e5 + 5;
int MOD = 998244353;
int bit[200000];
int n, q;
map<int, vector<int>> mp;
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> q;
    for(int i = 1; i <= n; i++){
        int x; cin >> x;
        mp[x].pb(i);
    }
    while(q--){
        int l, r, x;
        cin >> l >> r >> x;
        auto it = mp.find(x);
        if(it == mp.end()){
            cout << 0 << nn;
            continue;
        }

        auto &vt = it->se;
        auto it1 = lb(vt.begin(), vt.end(), l);
        auto it2 = ub(vt.begin(), vt.end(), r);
//        int id1 = it1 - vt.begin();
//        int id2 = it2 - vt.begin();
//        cout << id1 << " " << id2 << nn;
        cout << it2 - it1 << nn;
    }
    return 0;
}