package jianzhioffer;
import java.util.*;
class ac {
int value=0;
int num=0;
public ac(int num,int value) {
this.value=value;
this.num=num;
}
}
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
while(sc.hasNext()){
int n= sc.nextInt();
ac[] a= new ac[n];
for(int i=0;i
int k=sc.nextInt();
a[i]=new ac(i+1, k);}
Arrays.sort(a,new Comparator() { @Override public int compare(ac o1, ac o2) {
// TODO Auto-generated method stub
return Integer.compare(o1.value, o2.value);
}
});
int q=sc.nextInt();
for(int i=0;i
int l=sc.nextInt();
int r=sc.nextInt();
int k=sc.nextInt();
int left=0;
int right=a.length-1;
while(left<=right){
int mid=(right-left)/2+left;
if(a[mid].value<=k)left=mid+1;
else right=mid-1;
}
int rindex=right;left=0;
while(left<=right){
int mid=(right-left)/2+left;
if(a[mid].value>=k)right=mid-1;
else left=mid+1;
}
right=rindex;
int res=0;
while(left<=right){
if(a[left].num>=l && a[left].num<=r)res++;left++;
}
System.out.println(res);
}
}
}
}