#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int n,m,a[10000010],f[10000010],cnt[400010],o;
int main(){
	scanf("%d%d",&n,&m);
	for (int i=1;i<=m;i++){
		int op;
		scanf("%d",&op);
		if (op==0){
			int c,d;
			scanf("%d%d",&c,&d);
			f[c]++;
			f[d+1]--;
		}
		if (op==1){
			o++;
			scanf("%d",&cnt[o]);
		}
	}
	for (int i=1;i<=10000000;i++){
		a[i]=a[i-1]+f[i];
	}
	for (int i=1;i<=o;i++){
		printf("%d\n",a[cnt[i]]);
	}
	return 0;
}