Fundraising

To even begin running a campaign, you need money. How else would you pay for annoying robo-calls, slanderous TV ads against your opponent, or all the suits you have to wear on the campaign trail? There are many ways to raise funds: old-fashioned donations, online ads, expensive fund-raising dinners, and more.

Because campaign donations can be construed (unfortunately, often rightly so) as buying influence over a candidate, campaign-finance laws limit the total amount any person may donate to a candidate or party. Under the law, any individual may contribute at most $2100 to any one candidate, and at most $40000 in total. When these donations are split across many transactions, though, it can be hard to figure out just how much someone gave.

Write a program that reads a sequence of individual donations and determines whether any limits were violated, and if so, which donors are the violators.

The first line contains an integer $K \ge 1$, the number of data sets. It is followed by $K$ data sets of the following form.

The first line of a data set contains three integers $c$, $d$, $t$ with $1 \le c \le 100$, $1 \le d \le 1000$, and $1 \le t \le 100000$. Here $c$ is the number of candidates (numbered $1, \dots, c$), $d$ is the number of donors (numbered $1, \dots, d$), and $t$ is the number of transactions.

This is followed by $t$ lines, each containing three integers $d_i$, $c_i$, $m_i$. This means that in transaction $i$, donor $d_i$ gave $m_i$ dollars to candidate $c_i$. The same donor-candidate pair may appear multiple times.

For each data set, first output the line Data Set x: by itself, where $x$ is the number of the data set. Then output either the single line No violations, or the line Violators: followed by every donor who broke at least one limit, one per line. List the donors in increasing order of donor number.

A donor is a violator if the total they gave to some single candidate exceeds $2100, or the total they gave across all candidates exceeds $40000.