L1-019 谁先倒 (15 分)
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s=new Scanner(System.in);
int jia=s.nextInt();
int yi=s.nextInt();
int n=s.nextInt();
//
int a=0,b=0,i=0;
while(i<n) {
int m1,n1,m2,n2;
m1=s.nextInt();
n1=s.nextInt();
m2=s.nextInt();
n2=s.nextInt();
int p=m1+m2;
if(n1==n2&&n1==p) {
continue;
}
if(n1==p) {
a++;
if(a>jia) {
System.out.println("A");
System.out.print(b);
System.exit(0);
}
}
if(n2==p) {
b++;
{
if(b>yi) {
System.out.println("B");
System.out.print(a);
System.exit(0);
}
}
}
i++;
}
}
}