#include <bits/stdc++.h>

using namespace std;

struct pond{
 double volume;
 double filled;
 double input;
};

int n;
int vol;
vector<pond> data;
double global_time;

bool load_data(){
   if(scanf("%d %d\n", &n, &vol)!=2)return false;
   global_time = 0;
   
   data.clear();
   int temp;
   for(int i=0; i<n; i++){
     scanf("%d", &temp);
     pond p;
     p.volume = temp;
     p.filled = 0;
     p.input = vol;
     data.push_back(p);
   }
   
   return true;
}

double shortest_time(){
  double shortest = -1;
  for(int i=0; i<n; i++){
    if(data[i].input != 0){
      double time = (data[i].volume - data[i].filled) / data[i].input;
      if(shortest == -1 || shortest > time){
        shortest = time;
      }
    }
  }
  return shortest;
}

double step(){
  double time = shortest_time();
  if(time == -1)return -1;
  double overflow = 0;
  
  for(int i=0; i<n; i++){
    data[i].filled += data[i].input * time;
    if(data[i].filled == data[i].volume){
      overflow += data[i].input;
      data[i].input = 0;
    }else{
      data[i].input += overflow;
      overflow = 0;
    }
  }
  
  global_time += time;
  return overflow;
}

int main() {
	ios::sync_with_stdio(false);
	
	while(load_data()){
	  
	  double first = -1;
	  double last = -1;
	  do{
	    double i = step();
	    if(i!=0 && first == -1)
	      first = global_time;
	    if(i==-1)
	      last = global_time;
	  }while(last == -1);
	  cout << first << " " << last << endl;
	}
	
	
	/*
	int n, max;
	vector<int> arr;
	while(scanf("%d", &n) == 1) {
		max = 0;
		arr.resize(n);
		for(int i = 0; i < n; i++) {
			scanf("%d",&arr[i]);
		}
		int p = 0;
		while(arr[p] != (p+1) && p < n) {
			swap(arr[p], arr[arr[p]-1]);
			max++;
			while(arr[p] == (p+1) && p < n) p++;
		}
		cout << max << endl;
	}
	*/
	
	return 0;
}