#include<bits/stdc++.h>
using namespace std;
const int N=1e9;
int a[N];
int b[N];
int n,m;
int ans;
bool cmp(int x,int y){
	return x>y;
}
int main() {
	cin>>n>>m;
	for(int i=1; i<=n; i++) {
		cin>>a[i];
		bool flag;
		int x,y;
		cin>>flag>>x>>y;
		int l=y-x;
		for(int j=x; j<=y; j++) {
			if(flag==0) {
				sort(a+x,a+y+1,cmp);
				while(a[i]==a[i-1]||a[i]==a[i+1])
                    ans++;
				}
            else
				continue;
		}
		cout<<ans<<endl;
	}
	return 0;
}