Cipollino
The school year has ended, and the holidays have begun. Chipolino wants to meet up with friends, but they all live in different parts of their rectangular city. The city is organized in a grid of X by Y houses. Chipolino is interested in exploring a specific area of the city, defined by corners at (X_1, Y_1) and (X_2, Y_2), and he wants to know how many friends and enemies reside within this area. Additionally, people from another city may move into any rectangular area (X_1, Y_1) to (X_2, Y_2), with exactly K people per house—these could be either friends or enemies of Chipolino.
Your task is to determine whether there are more friends or enemies in the specified area. Chipolino is counting on you to help him with this challenge.
Input
The first line of input contains the dimensions of the city, X and Y (1 ≤ X, Y ≤ 1000). The next line provides the number of vacation days remaining, N (1 ≤ N ≤ 100000). For each of the N days, Chipolino's actions are described in the following format:
1 X1 Y1 X2 Y2 — Chipolino wants to know the number of friends and enemies in the specified area. If there are more friends, output "Friends"; if there are more enemies, output "Enemies"; otherwise, output "I don't know" (1 ≤ X_1 ≤ X_2 ≤ X, 1 ≤ Y_1 ≤ Y_2 ≤ Y).
2 X1 Y1 X2 Y2 K — K people move into the city. If K > 0, they are friends; if K < 0, they are enemies (1 ≤ X_1 ≤ X_2 ≤ X, 1 ≤ Y_1 ≤ Y_2 ≤ Y, -10000 ≤ K ≤ 10000).
Output
For each query starting with 1, output whether there are more friends or enemies in the area.