/*Siberian Squirrel*//*Cute KiloFish*/#include<bits/stdc++.h>#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)#define ACM_LOCALusingnamespace std;typedeflonglong ll;constdouble PI =acos(-1);constdouble eps =1e-4;constint INF =0x3f3f3f3f;/*const int MOD = 998244353, r = 119, k = 23, g = 3;
const int MOD = 1004535809, r = 479, k = 21, g = 3;*/constint MOD =1e9+7;constint M =1e7+10;constint N =1e6+10;constint UP =50;//inline int rnd(){static int seed=2333;return seed=(((seed*666666ll+20050818)%998244353)^1000000007)%1004535809;}int n, m, p, q;voidsolve(double res =0){
res =(q +1.0)/(p +2);
cout << fixed <<setprecision(4)<< res;}intmain(){
IO;#ifdef ACM_LOCALfreopen("input","r",stdin);freopen("output","w",stdout);#endifint o =1, cases =0;// cin >> o;while(o --){while(cin >> n >> p >> q){
cout <<"Case "<<++ cases <<": ";solve();
cout << endl;}}return0;}
A Famous Gamecode/*Siberian Squirrel*//*Cute KiloFish*/#include<bits/stdc++.h>#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)#define ACM_LOCALusing namespace std;typedef long long ll;const double PI = acos(-1);const double