COCI '07 Contest 4 #1 Vauvau

View as PDF

Points: 5
Time limit: 1.0s
Memory limit: 32M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

In a nearby village, the postman, milkman and garbage man face the same problem morning after morning: house . House 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 minutes and is then calm for minutes. Similarly, the other dog is aggressive for minutes, then calm for 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 Specification

The first line of input contains the integers , , and . The second line contains the integer , and , the minute in the day during which the postman, milkman and garbage man arrive at house . For example, if is , it should be interpreted as "the postman arrived sometime during the third minute in the day". All numbers in the input will be between and .

Output Specification

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

2 2 3 3
1 3 4

Sample Output 1

both
one
none

Sample Input 2

2 3 4 5
4 9 5

Sample Output 2

one
none
none