#include <algorithm>
#include <fstream>
#define N 1005
using namespace std;
ifstream fin("afise.in");
ofstream fout("afise.out");
struct afis
{
    int rau, alb;
}S[N];

int L, n, k, m;
int viz[N];

bool comp(afis x, afis y)
{
    return x.alb<y.alb;
}
int main()
{
    int x;
    fin>>L>>n>>k;
    for(int i=1;i<=n;i++)
    {
        fin>>x; viz[x]=1;
    }

    int rau=0, alb=0,i;
    i=1;
    while(viz[i]==0 && i<=L)i++;
    while(i<=L)
    {
        while(viz[i]==1 && i<=L){rau++; i++;}
        while(viz[i]==0 && i<=L){alb++; i++;}
        m++;
        S[m].rau=rau;
        S[m].alb=alb;
        rau=alb=0;
    }
    m--;
    sort(S+1, S+m+1, comp);

    int val=0, Nk=0;
    m++;
    for(i=1;i<=m;i++)val+=S[i].rau;

    Nk=m;
    if(m>k)
    {
        i=1;
        while(Nk>k&& i<=m)
        {
            val+=S[i].alb; i++, Nk--;
        }
        fout<<val<<" "<<Nk;
    }
    return(0);
}