//#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("cutii.in");
ofstream cout("cutii.out");
int aib[3550][3550],n;
void u(int a,int b,int val){
    for(int i=a;i<=n;i+=(i&(-i))){
        for(int j=b;j<=n;j+=(j&(-j))){
            aib[i][j]+=val;
        }
    }
}
int q(int a,int b){
    int sum=0;
    for(int i=a;i>=1;i-=(i&(-i))){
        for(int j=b;j>=1;j-=(j&(-j))){
            sum+=aib[i][j];
        }
    }
    return sum;
}
pair<int,pair<int,int> > v[3550];
int main()
{
    int t;
    cin>>n>>t;
    while(t--){
        for(int i=1;i<=n;i++){
            cin>>v[i].first>>v[i].second.first>>v[i].second.second;
        }
        sort(v+1,v+n+1);
        int sum=0,pr=1;
        for(int i=1;i<=n;i++){
            if(v[i].first!=v[i-1].first){
                for(int j=pr;j<i;j++){
                    //cout<<"="<<i<<" "<<j<<"=";
                    u(v[j].second.first,v[j].second.second,1);
                }
                pr=i;
                sum+=q(v[i].second.first-1,v[i].second.second-1);
            }
        }
        for(int i=1;i<=n;i++){
            u(v[i].second.first,v[i].second.second,-1);
        }
        cout<<sum<<"\n";
    }
    return 0;
}