#include <iostream>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
int pref_1[maxn], pref_2[maxn], pref_3[maxn];

int main() {
    ios_base::sync_with_stdio(false);

    int n, q;
    cin >> n >> q;

    vector<int> v(n);
    int sum1 = 0, sum2 = 0, sum3 = 0;

    for(int i = 0; i < n; i++) {
        cin >> v[i];
        if(v[i] == 1) {
            sum1++;
        }
        if(v[i] == 2) {
            sum2++;
        }
        if(v[i] == 3) {
            sum3++;
        }

        pref_1[i] = sum1;
        pref_2[i] = sum2;
        pref_3[i] = sum3;
    }

    for(int i = 0; i < q; i++) {
        int a, b;
        cin >> a >> b;

        a--; b--;


        int res1, res2, res3;
        if(a == 0) {
            res1 = pref_1[b];
            res2 = pref_2[b];
            res3 = pref_3[b];
        }
        else {
            res1 = pref_1[b] - pref_1[a - 1];
            res2 = pref_2[b] - pref_2[a - 1];
            res3 = pref_3[b] - pref_3[a - 1];
        }
        cout << res1 << " " << res2 << " " << res3 << endl;

    }
    return 0;
}