#include<cstdio>
#include<map>
//#include<bits/stdc++.h>
#include<vector>
#include<stack>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<cstdlib>
#include<climits>
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef __int64 int64;
const ll mood=1e9+7;
const int64 Mod=998244353;
const double eps=1e-9;
const int N=2e7+10;
const int MAXN=2005;
typedef int rl;
inline void r(rl&num){
    num=0;rl f=1;char ch=getchar();
    while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
    while(ch>=‘0‘&&ch<=‘9‘)num=num*10+ch-‘0‘,ch=getchar();
    num*=f;
}
double L,a,b;int ci;
void init()
{
    scanf("%lf%lf%lf%d",&L,&a,&b,&ci);
}
double t[MAXN];
int main()
{
    int T;
    r(T);
    while(T--)
    {
        init();
        double tem=fabs(a-b),te=a+b;
        for(int i=0;i<1000;i++)
        {
            t[2*i]=(2*i+1)*L/tem;
            t[2*i+1]=(2*i+1)*L/te;
        }
        sort(t,t+2000);
        double x=t[ci-1];
        double y=t[ci-1]*a;
        y-=floor(y/L)*L;
        y=min(y,fabs(L-y));
        printf("Time=%.3f Dist=%.3f\n",x,y);
    }
    return 0;
}