Problem E
Vauvau
In a nearby village, the postman, milkman and garbage man face the same problem morning after morning: house 18. House 18 is guarded by two dogs that often cause problems. What they don’t know is that the dogs’ behaviour is completely predictable.
When the day starts, one dog is aggressive for $A$ minutes and is then calm for $B$ minutes. Similarly, the other dog is aggressive for $C$ minutes, then calm for $D$ minutes. Both dogs repeat their behaviours indefinitely, starting a new aggressive period after the calm period, then another calm period etc.
Given the arrival times of the postman, milkman and garbage man, determine how many dogs (none, one or both) attack each of them.
Input
The first line of input contains the integers $A$, $B$, $C$ and $D$.
The second line contains the integer $P$, $M$ and $G$, the minute in the day during which the postman, milkman and garbage man arrive at house 18. For example, if $P$ is 3, it should be interpreted as "the postman arrived sometime during the third minute in the day".
All numbers in the input will be between 1 and 999.
Output
Output should consist of three lines; each containing ’both’, ’one’ or ’none’, depending on how many dogs attack each of our heroes.
| Sample Input 1 | Sample Output 1 |
|---|---|
2 2 3 3 1 3 4 |
both one none |
| Sample Input 2 | Sample Output 2 |
|---|---|
2 3 4 5 4 9 5 |
one none none |