import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

N=int(readline())
B=int(readline())
A=list(map(float,readline().split()))
ans=0
for a in A:
    ans+=a*B**(a-1)
print(ans)
ans=0
eps=1e-10
for a in A:
    if abs(a+1.0)<eps:
        ans+=math.log(B)
    else:
        ans+=B**(a+1)/(a+1)
print(ans)