#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<deque>
#define maxn 100005
using namespace std;
int n,q,a[maxn],b[maxn][5],l,r;
void init(){
     scanf("%d%d",&n,&q);
     for(int i=1;i<=n;i++){
       scanf("%d",&a[i]);
       b[i][a[i]]=1;
       b[i][1]+=b[i-1][1];
       b[i][2]+=b[i-1][2];
       b[i][3]+=b[i-1][3];
     }
}
void work(){
     while(q--){
          scanf("%d%d",&l,&r);
          printf("%d %d %d\n",b[r][1]-b[l-1][1],b[r][2]-b[l-1][2],b[r][3]-b[l-1][3]);
     }
}      
void check(){
     for(int i=1;i<=n;i++){
       for(int j=1;j<=3;j++)
         cout<<b[i][j]<<" ";
       cout<<endl;
     }
}
int main(){
    freopen("fans.in","r",stdin);
    freopen("fans.out","w",stdout);
    init();
    work();
    //check();
    //system("pause");
    return 0;
}