#include<bits/stdc++.h>

using namespace std;

#define MAXN 100010

int n , q;

struct Binary_Indexed_Tree

{

        int c[MAXN];

        inline int lowbit(int x)

        {

                return x & (-x);

        }

        inline void modify(int x , int val)

        {

                for (int i = x; i <= n; i += lowbit(i)) c[i] += val;

        }

        inline int query(int x)

        {

                int ret = ;

                for (int i = x; i; i -= lowbit(i)) ret += c[i];

                return ret;

        }

        inline int query(int l , int r)

        {

                return query(r) - query(l - );

        }

} bit1 , bit2 , bit3;

template <typename T> inline void chkmax(T &x,T y) { x = max(x,y); }

template <typename T> inline void chkmin(T &x,T y) { x = min(x,y); }

template <typename T> inline void read(T &x)

{

    T f = ; x = ;

    char c = getchar();

    for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;

    for (; isdigit(c); c = getchar()) x = (x << ) + (x << ) + c - '';

    x *= f;

}

int main()

{

        read(n); read(q);

        for (int i = ; i <= n; i++)

        {

                int x;

                read(x);

                if (x == ) bit1.modify(i , );

                else if (x == ) bit2.modify(i , );

                else bit3.modify(i , );

        }

        while (q--)

        {

                int l , r;

                read(l); read(r);

                printf("%d %d %d\n",bit1.query(l , r) , bit2.query(l , r) , bit3.query(l , r));

        }

        return ;

}