#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<string>
using namespace std;

void countaToz(string s,int *c){
  for(int i=0;i<26;i++){
  c[i]=0;
  }
  for(int i=0;i<s.length();i++){
    c[s[i]-'a']++;
  }
}

bool check(string a,string b,string s){
  int ca[26],cb[26],cs[26];
  countaToz(a,ca);
  countaToz(b,cb);
  countaToz(s,cs);
  for(int i=0;i<26;i++){
    if(cs[i]>(ca[i]+cb[i]))return false;
  }
  return true;
}

int getInitial(string tmp,char c){
  for(int i=0;i<tmp.length();i++){
    if(tmp[i]==c)return i;
  }
  return -1;
}

int dp(string a,string b,string s,int count){
  if(check(a,b,s)==false)return -1;
  if(!s.length())return count;
  int ia=getInitial(a,s[0]);
  int ib=getInitial(b,s[0]);
  int reta=-1,retb=-1;
  if(ia!=-1)reta=dp(a.substr(ia+1),b,s.substr(1),count+ia+1);
  if(ib!=-1)retb=dp(a,b.substr(ib+1),s.substr(1),count+ib+1);
  if(reta==-1&&retb==-1)return -1;
  if(reta==-1)return retb;
  if(retb==-1)return reta;
  return min(retb,reta);
}

int main(){
  int n,b;
  double a[10]={};
  cin >> n >> b;
  //dif
  double bibun=0;
  double sekibun=0;
  for(int i=0;i<n;i++){
    cin >> a[i];
  }
  for(int i=0;i<n;i++){
    if(a[i]){
      bibun+=a[i]*pow(b,a[i]-1.);
    }else{
      bibun;
    }

    if(a[i]!=-1){
      sekibun+=pow(b,a[i]+1)/(a[i]+1.);
    }else{
      sekibun+=log(b);
    }
  }
  printf("%.6f\n%.6f\n",bibun,sekibun);
  return 0;
}