#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+;

const int64 Mod=;

const double eps=1e-;

const int N=2e7+;

const int MAXN=;

typedef int rl;

inline void r(rl&num){

    num=;rl f=;char ch=getchar();

    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

    while(ch>=''&&ch<='')num=num*+ch-'',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=;i<;i++)

        {

            t[*i]=(*i+)*L/tem;

            t[*i+]=(*i+)*L/te;

        }

        sort(t,t+);

        double x=t[ci-];

        double y=t[ci-]*a;

        y-=floor(y/L)*L;

        y=min(y,fabs(L-y));

        printf("Time=%.3f Dist=%.3f\n",x,y);

    }

    return ;

}