#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll id[100005];
struct xft
{
	ll sco,id_c;
}a[100005];
int main()
{
	ll cla,inf,max_id=0,di=0,kuang=0;
	cin>>cla>>inf;
	memset(a,-1,sizeof(a));
	for(ll i=1;i<=cla;i++)
	{
		cin>>id[i];
		id[id[i]]=id[i];
	}
	max_id=id[cla];
	for(ll i=1;i<=inf;i++)
	{
		ll n_id,n_sco;
		cin>>n_id>>n_sco;
		a[n_id].sco=n_sco;
		a[n_id].id_c=n_id;
	}
	for(int i=1;i<=max_id;i++)//给每个编号都赋值
	{
		a[i].id_c=i;
	}
	for(ll i=1;i<=max_id;i++)
	{
		if(a[i].sco==-1&&a[i].id_c==id[a[i].id_c])//分数-1（没考） 且 该课程编号刚好等于录入的课程编号
		{
			kuang++;
			di++;
		}
		if(a[i].sco<60&&a[i].sco!=-1)//不是没考，但不及格
		{
			di++;
		}
	}
	cout<<kuang<<endl<<di;
	return 0;
}

即将考试，救救我