#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long double ld;


#define lmao ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll N =  1e5 + 5 , M = 1e4+5 , MOD = 1e9 + 7, LOG = 20 , Msk = 21 , pw1 = 31 , pwe2 = 37 ;


void testCase() {
   ll m,nn;
   ld sum=0,n;
   cin>>n>>m;
   nn=n;
   n-=m;
   for(int i=0;i<m;i++)
   {
       int x;
       cin>>x;
       sum+=x;
   }
   cout << fixed << setprecision(8) << (sum+(n*-3.0))/nn <<' '<< fixed << setprecision(8) <<(sum+(n*3.0))/nn;
}

signed main() {

    lmao
    int t = 1;
//    cin >> t;
    while (t--)
        testCase();
}