#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;

const int MAXN=100000;

int n,m,i,j,k,a[MAXN],b[MAXN],c,ans1,ans2;

int main()
{
	freopen("criminala.in","r",stdin);
	freopen("criminala.out","w",stdout);
	scanf("%d%d",&n,&m);
	memset(a,0,sizeof(a));
	memset(b,0,sizeof(b));
	for (i=1;i<=m;i++)
	{
		scanf("%d",&c);
		if (c<0) a[-c]++;
		else b[c]++;
	}
	ans1=ans2=0;
	for (i=1;i<=n;i++)
	{
		ans1+=min(a[i],b[i]);
		ans2+=max(a[i],b[i]);
	}
	printf("%d\n%d\n",ans2,ans1);
	return 0;
}