JUMP1 - Jumping Hands

no tags 

In Shanghai, there are some famous clock towers built more than 100 years ago, such as the office building of Shanghai Customs, Xujiahui Church, etc. Every clock tower’s clock-face consists of three hands: an hour hand, a minute hand, and a second hand. The hands are not move smoothly as time passing. When a second passes, the hands jump to the next place clockwise: the second hand moves 1/60 ring, the minute hand moves 1/3600 ring and the hour hand moves 1/43200 ring.

We assume that every hand’s mass is evenly distributed, and its thickness can be ignored. In other words, every hand’s centre of gravity is at the middle position of the respective hand. Suppose p1, p2 and p3 are, respectively, the position of the centre of gravity of the hour hand, that of the minute hand, and that of the second hand. The position of all three hands’ centre of gravity, P, is the average of p1, p2 and p3 weighted by the hands’ mass.

Suppose P1 and P2 are the positions of the three hands’ centre of gravity at the start time and at the end time, respectively. Your task is to calculate the length of the path from P1 to P2. That is, if P3 is the position of the three hands’ centre of gravity on the clock-face at a point of time between start time and end time, X is the length of the path from P1 to P3, and Y is the length of the path from P3 to P2, the length of the path from P1 to P2 is X+Y.

Input

Input consists of one or more lines, each line describing one data set. Each line begins with 6 integers: L1, L2, L3, M1, M2, M3, followed by start time and end time. L1, L2 and L3 indicate the lengths of hour hand, minute hand and second hand respectively, where 1<= L1<L2<L<=100. M1, M2 and M3 indicate the weights of hour hand, minute hand and second hand respectively, where 1<= M1, M2, M3 <=100. The format of start time and end time is hh:mm:ss, where 0<= hh <=23, 0<= mm <=59, and 0<= ss <=59. Start time and end time should be in the same day.

End of input is indicated by a line consisting of -1.

Output

For each data set, output a single line. Each line should give the length of the path for the positions of three hands’ centre of gravity at the start time and at the end time. We accept solutions with absolute error less than 10-2.

Example

Input:
1 2 3 1 2 3 00:00:00 00:00:01
3 4 5 1 1 1 09:00:00 18:00:00
-1

Output:
0.08
2826.27

hide comments
sparky: 2014-12-05 16:10:30

getting the value as 2827.56 for the second sample test case on using double and 2827.54 on using float, both very far from the actual value.

Last edit: 2014-12-05 16:11:17

Added by:Fudan University Problem Setters
Date:2009-05-23
Time limit:2s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: C99 ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:Fudan University Local Contest #1