#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

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

    vector<double> A(N);

    for ( int i = 0; i < N; i++ ) {
        cin >> A[i];
    }
    
    double ans = 0;
    for ( int i = 0; i < N; i++ ) {
        ans += A[i]*pow(B,A[i]-1);
    }
    printf( "%.9f\n", ans );

    
    ans = 0;
    for ( int i = 0; i < N; i++ ) {
        if ( A[i] == -1.0 ) { ans += log(B); }    
        else { ans += 1/(A[i]+1) * pow(B,A[i]+1); }
    }
    printf( "%.9f\n", ans );

    return 0;
}