Condorcet Winners#2677
A Condorcet winner of an election is a candidate who would beat any of the other candidates in a one-on-one contest. Determining a Condorcet winner can only be done when voters specify a ballot listing all of the candidates in their order of preference (we will call such a ballot a preference list). For example, assume we have candidates - , , and - and three voters whose preference lists are , , and . Here, is the Condorcet winner, beating in of the three ballots (ballots and ) and beating in of the three ballots ( and ).
The Condorcet voting system looks for the Condorcet winner and declares that person the winner of the election. Note that if we were only considering first place votes in the example above (as is done in most elections in the US and Canada), then there would be a tie for first place. There can be at most only one Condorcet winner, but there is a small drawback to the Condorcet system: it is possible that there is no Condorcet winner.
Input for each test case starts with a single line containing two positive integers and , where is the number of ballots and is the number of candidates. Candidates are numbered , ..., c-1. Following this first line are lines, each containing values. Each of these lines represents one ballot and contains the values , ..., c-1 in some permuted order. The values of and will be in the ranges and , respectively, and the line will follow the last test case.
For each test case, output a single line containing either the candidate number of the Condorcet winner, or the phrase No Condorcet winner using the specified format.
Example 1