#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

int main()
{
	int N,B;
	cin >> N >> B;

	double fb=0, Fb=0;
	for (int i = 0; i < N; i++) {
		double a;
		cin >> a;

		if (a - 1 != 0) {
			fb += a*pow(B, a - 1);
		}
		if (a + 1 != 0) {
			Fb += 1 / (a + 1) * pow(B, a + 1);
		}
		else {
			Fb += log(B);
		}
	}
	printf("%.20f\n",fb);
	printf("%.20f\n", Fb);

	return 0;
}