Equal Schedules

You are one of the people on-call for a high-availability service that lets users solve programming tasks. Your team has an on-call schedule that says who is responsible for the service at each time.

A colleague sent you a new schedule. You want to check that everyone has the same on-call time as before, and print any differences.

The on-call schedule is written as lines of the form $s_i$ $e_i$ $t_i$. Here $s_i$ and $e_i$ are the start and end offsets of a shift, counted from some start hour, and $t_i$ is the teammate on call for that shift.

For example, take this schedule.

0 7 jan
7 14 tomaz
14 20 jure
20 24 jan
24 25 tomaz
25 26 jure

jan is on call for the first 7 hours (hours 0 through 6), and tomaz is on call for the next 7. In total, jan is on call for 11 hours, tomaz for 8, and jure for 7.

The input contains two schedules separated by a line ------. Each schedule has one or more lines of the form $s_i$ $e_i$ $t_i$, where the integers $s_i$ and $e_i$ mean that teammate $t_i$ is on call for hours from $s_i$ up to but not including $e_i$. A final line ====== comes after the second schedule.

Print the differences between the two schedules as $t_i \pm d_i$, where $d_i$ is the second schedule's on-call time minus the first schedule's on-call time for teammate $t_i$. Sort the output by teammate name in alphabetical order. Omit teammates with no difference. Every printed difference has a + or - sign. If no differences exist, print No differences found.

For each schedule, the following holds:

• $s_1 = 0$
• $s_i < e_i$
• $s_{i+1} = e_i$
• $e_i \leq 1000$
• The name $t_i$ consists of lowercase English letters.
• $3 \leq |t_i| \leq 20$