#include<iostream>
#include<iomanip>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{//sqrt- pow+ fixed<<setprecision(num)/
	int n,k,a[10001],b[10001],count1=0,count2=0,sum1,sum2;
	double ans1,ans2;
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		if(i%k==0){//a
			i=a[count1];
			count1++;
		}else{//b
			i=b[count2];
			count2++;
		}
	}
	//////////////////////////
	for(int i=1;i<=count1;i++){
		sum1+=a[i];
	}
	for(int i=1;i<=count2;i++){
		sum2+=b[i];
	}
	ans1=sum1/count1;ans2=sum2/count2;
	cout<<fixed<<setprecision(1)<<ans1;
	cout<<fixed<<setprecision(1)<<ans2;
	return 0;
}