#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
using namespace std;
struct mem
{
	char name[20];
	int to;

}member[100010];
struct msm
{
	char l;
	int to;

}rule;
int n,_rule,w=0;
int main()
{
	freopen("toya.in","r",stdin);
	freopen("toya.out","w",stdout);
	scanf("%d%d",&n,&_rule);
	for (int i = 0; i < n; ++i)
		scanf("%d%s",&member[i].to,member[i].name);

	for (int i = 0; i < _rule; ++i)
	{
		scanf("%d%d",&rule.to,&rule.l);
		if (member[w].to==rule.to)
		{
			w-=rule.l;
			if (w<0)
			{
				w+=n;
			}
		}
		else
		{
			w+=rule.l;
			if (w>=n)
			{
				w-=n;
			}
		}
	}
	printf("%s\n", member[w].name);
	return 0;
}