#include <bits/stdc++.h>
using namespace std;
typedef pair<pair<int,int>,pair<int,int>> pii;
const int c=150002;

int fen[c];

void update(int pos, int val){
    for(;pos<c;pos+=pos&-pos){
        fen[pos]+=val;
    }
}

int query(int pos){
    int res=0;
    for(;pos>0;pos-=pos&-pos){
        res+=fen[pos];
    }
    return res;
}

vector<int> comp;

inline int f(int k){
    return (lower_bound(comp.begin(),comp.end(),k)-comp.begin())+1;
}

int n,m;
vector<pii> v;

inline int read(){
    int res=0; char ch=getchar();
    while(ch<'0' || '9'<ch) ch=getchar();
    while('0'<=ch && ch<='9'){
        res=(res<<3) + (res<<1) + ch-'0';
        ch=getchar();
    }
    return res;
}

int maxi;
int ans;

int main(){
    m=read(); n=read();
    
    for(int i=1;i<=m;i++){
        int x1,x2,y; x1=read(); x2=read(); y=read();
        v.emplace_back(make_pair(make_pair(x1,0),make_pair(y,0)));
        v.emplace_back(make_pair(make_pair(x2,c),make_pair(y,0)));
        comp.emplace_back(y);
    }

    for(int i=1;i<=n;i++){
        int x,y1,y2; x=read(); y1=read(); y2=read();
        v.emplace_back(make_pair(make_pair(x,i),make_pair(y1,y2)));
        comp.emplace_back(y1);
        comp.emplace_back(y2);
    }

    sort(v.begin(),v.end());
    sort(comp.begin(),comp.end());
    comp.resize(unique(comp.begin(),comp.end())-comp.begin());

    maxi=0; ans=0;

    for(int i=0;i<n+2*m;i++){
        if(v[i].first.second==0){
            update(f(v[i].second.first),1);
        }
        else if(v[i].first.second==c){
            update(f(v[i].second.first),-1);
        }
        else{  
            int id=v[i].first.second;
            int y1=f(v[i].second.first);
            int y2=f(v[i].second.second);
            int cur=query(y2)-query(y1-1);
            if(cur>maxi || (cur==maxi && id < ans)){
                ans=id;
                maxi=cur;
            }
        }
    }

    cout << ans << endl;
}