#include <iostream>
#include <math.h>
using namespace std;


int main()
{
    unsigned long long n, k , maxim = 0 , poz;
    cin >> n >> k;
  unsigned long long fr[n];
    for(unsigned long long i = 1; i <=n;i++) fr[i] = 0;


    for(unsigned long long i = 1; i <=k;i++)
    { unsigned long long a, b;
       cin >> a;
      b = ceil( (-1 + sqrt(1 + 8 * a))/2);
     fr[b]++;
     if(fr[b] > maxim)
     {
         maxim = fr[b];
         poz = b;
     }

    }



    cout << poz <<'\n' <<2*n-2;
    return 0;
}