https://vjudge.net/problem/Gym-101142K
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=1e5+9;
const int mod=1e9+7;
struct node
{
int id,d,m,y;
}a[maxn];
bool cmp(node aa,node bb)
{
if(aa.y>bb.y) return 1;
else if(aa.y==bb.y&&aa.m>bb.m) return 1;
else if(aa.y==bb.y&&aa.m==bb.m&&aa.d>bb.d) return 1;
return 0;
}
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
freopen("king.in","r",stdin);
freopen("king.out","w",stdout);
int d,y,m;
while(~scanf("%d%d%d",&d,&m,&y))
{
int n;
sfi(n);
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",&a[i].d,&a[i].m,&a[i].y);
a[i].y+=18;
a[i].id=i;
}
sort(a+1,a+1+n,cmp);
int ans=-1;
for(int i=1;i<=n;i++)
{
if(a[i].y<y||(a[i].y==y&&a[i].m<m)||(a[i].y==y&&a[i].m==m&&a[i].d<=d))
{
ans=a[i].id;
break;
}
}
printf("%d\n",ans);
}
return 0;
}