#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;


int main() {
    int N, B;
    cin >> N;
    cin >> B;
    vector<double> a(N);
    for (int i = 0; i < N; i++) cin >> a[i];
    double df = 0;
    for (int i = 0; i < N; i++) {
        df += a[i] * pow(B, a[i]-1);
    }
    double F = 0;
    for (int i = 0; i < N; i++) {
        if (abs(a[i]+1) < 1e-5) F += log(B);
        else F += pow(B, a[i]+1) / (a[i]+1);
    }
    printf("%.12lf\n", df);
    printf("%.12lf\n", F);
    return 0;
}