#include <cstdlib>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long LL;

const int MAXN=1010;
struct mode
{
    int y,n;
} a[MAXN];

int main()
{
    freopen("criminala.in","r",stdin);
    freopen("criminala.out","w",stdout);
    int n,m;int maxa=0,mina=0;
    scanf("%d%d",&n,&m);
    for(int i=0;i<m;i++)
    {
        int t;scanf("%d",&t);
        if(t>0) a[t].y++;
        else a[-t].n++;
    }
    for(int i=1;i<=n;i++)
    {
        maxa+=max(a[i].y,a[i].n);
        mina+=min(a[i].y,a[i].n);
    }
    printf("%d\n%d",maxa,mina);
    //system("PAUSE");
    return 0;
}