#include <queue>
#include <algorithm>
#include <vector>
#include <set>
#include <iostream>
#include <numeric>
#include <tuple>
#include <cmath>
#include <iomanip>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef tuple<ll, ll, ll> tiii;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define ALL(container) (container).begin(), (container).end()

int main(){
    int N, B;
    cin >> N;
    cin >> B;
    vector<double> a(N);
    for(int i = 0;i < N;i++)
    {
        cin >> a[i];
    }
    {
        double sum = 0;
        for(int i = 0; i < N;i++)
        {
            double d = a[i] * pow(B, a[i]-1);
            sum += d;
        }
        cout << fixed
        << setprecision(8)
        << sum
        << endl;
    }
    {
        double sum = 0;
        for(int i = 0; i < N;i++)
        {
            double d = 1 / (a[i]+1) * pow(B, a[i]+1);
            sum += d;
        }
        cout << fixed
        << setprecision(8)
        << sum
        << endl;
    }
    return 0;
}