Peer Review#3071
For scientific conferences, scientists submit papers presenting their ideas and then review each other's papers to ensure that only good papers are presented at the conference. Each paper must be reviewed by several scientists, and scientists must not review papers written by people they collaborate with (including themselves), nor review the same paper more than once.
You have been asked to write a program to check if your favorite conference is following the rules properly. Whether a paper is being reviewed too much, too little, or by the wrong people, the organizers must know before it is too late!
The first line in each test case contains two integers, (1 \leq K \leq 5) and (1 \leq N \leq 1000). is the number of reviews that each paper will receive, and is the number of papers to be reviewed. The conference only accepts papers with a single author, and authors can only present one paper at the conference.
Each of the next lines describes an author and includes the name of the institution to which the author belongs, followed by a list of the papers they have been requested to review. Researchers from the same institution are considered to be collaborators, while researchers from different institutions are not. All institution names are shorter than characters, containing only upper or lowercase letters and no spaces. Since there are as many papers as authors, papers are identified by their author's index; paper was written by the first author in the list, and paper by the last author.
The end of the test cases is marked by a line containing K = 0 and N = 0. You should not generate any output for this line.
For each test case, your program should output NO PROBLEMS FOUND (if all rules are being followed) or PROBLEMS FOUND, where is the number of rule violations found (counting at most violation per paper). If there is exactly one rule violation in total, your program should output 1 PROBLEM FOUND.
Example 1