#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <stack>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
#define EPS 1.0e-10
#define ZEROP(x) (abs(x)<EPS)
#define EQ(x,y) ZEROP((x)-(y))
#define LT(x,y) ((x)+EPS<(y))
#define LE(x,y) ((x)-(y)<+EPS)

int main(){
  ios::sync_with_stdio(false);

  int N, B;
  vector<double> v;
  cin >> N;
  cin >> B;
  rep(i,N){
    double d;
    cin >> d;
    v.push_back(d);
  }

  double X1 = 0, X2 = 0;

  rep(i,N){
    X1 += v[i] * pow((double)B, v[i]-1);
    if(ZEROP(v[i]+1)){
      X2 += log((double)B);
    }else{
      X2 += 1.0 / (v[i]+1) * pow((double)B, v[i]+1);
    }
  }

  printf("%.9lf\n%.9lf\n", X1, X2);
  
  return 0;
}