#include <iostream>
#include <vector>
#include <algorithm>

int main(int argc, char const *argv[]) {
  int n, f;
  while (std::cin >> n)
  {
    std::cin >> f;
    std::vector<int> vec(n);
    double max = 0, tmp = 0;
    for (int i = 0; i < n; ++i)
    {
      std::cin >> vec[i];
      tmp += vec[i];
      max = std::max(max, tmp / (f * (i + 1)));
    }

    double lowest = 1e10;
    tmp = 0;
    for (int i = vec.size() - 1; i >= 0; --i)
    {
      tmp += vec[i];
      lowest = std::min(lowest, tmp / (f * (vec.size() - i)));
    }

    std::cout << lowest << ' ' << max << '\n';
  }

  return 0;
}