#include <bits/stdc++.h>
using namespace std;
const int MaxN=1e6;
const int MaxA=1e9;
int N,Q,x,L,R;
int A[MaxN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin>>N>>Q;
for(int n=0;n<N;n++)
cin>>A[n];
sort(A,A+N);
for(int q=0;q<Q;q++){
cin>>L>>R;
x=upper_bound(A,A+N,R)-lower_bound(A,A+N,L);
(x==0)?cout<<"The candies are too short\n":cout<<x<<"\n";
}
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpjb25zdCBpbnQgTWF4Tj0xZTY7CmNvbnN0IGludCBNYXhBPTFlOTsKaW50IE4sUSx4LEwsUjsKaW50IEFbTWF4Tl07CgppbnQgbWFpbigpIHsKCWlvczo6c3luY193aXRoX3N0ZGlvKDApOwoJY2luLnRpZSgwKTsgY291dC50aWUoMCk7CgljaW4+Pk4+PlE7Cglmb3IoaW50IG49MDtuPE47bisrKQoJICBjaW4+PkFbbl07Cglzb3J0KEEsQStOKTsKCWZvcihpbnQgcT0wO3E8UTtxKyspewoJCWNpbj4+TD4+UjsKCQl4PXVwcGVyX2JvdW5kKEEsQStOLFIpLWxvd2VyX2JvdW5kKEEsQStOLEwpOwoJCSh4PT0wKT9jb3V0PDwiVGhlIGNhbmRpZXMgYXJlIHRvbyBzaG9ydFxuIjpjb3V0PDx4PDwiXG4iOwoJfQp9