#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9+7;

int N;
double B;
double a[11];

double f_(double x){
    double ret=0;
    REP(i,0,N) ret += a[i] * pow(x, a[i]-1);
    return ret;
}

double F_(double x){
    double ret=0;
    REP(i,0,N) {
        if(a[i]!=-1) ret += pow(x, a[i]+1)/(a[i]+1);
        else ret+=log(x);
    }
    return ret;
}
int main(){
    cin>>N>>B;
    REP(i,0,N){
        cin>>a[i];
    }
    printf("%.5lf\n", f_(B));
    printf("%.5lf\n", F_(B));

    return 0;
}