#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int,int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for (int i=(n)-1;i>=0;i--)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define REPS(i,f,n) for (int i=(f)-1;i>=(n);i--)
int dx[4] = {1, 0, 0, -1};
int dy[4] = {0, 1, -1, 0};

int main(void){
	int n;
	scanf("%d", &n);
	long double b;
	scanf("%Lf", &b);

	vector<long double> a(n);
	rep(i, n)
		scanf("%Lf", &a[i]);

	long double bibun = 0;
	long double sekibun = 0;

	rep(i, n){
		bibun += a[i] * pow(b, a[i] - 1.0);
	}

	rep(i, n){
		if (a[i] + 1.0 != 0.0)
			sekibun += (1.0 / (a[i] + 1.0)) * pow(b, a[i] + 1.0);
		else
			//1/xの積分注意
			sekibun += log(b);

	}


	printf("%.9Lf\n%.9Lf\n", bibun, sekibun);

	return 0;

}