noi石头剪刀布

#include<iostream>
#include<cmath>
using namespace std;
int main(){
   int n,m,p;
   int A=0,B=0;
   cin >>p>>n>>m;
   int a[n],b[m];
   for (int i=0;i<n;i++)
       cin >>a[i];
   for (int i=0;i<m;i++)
       cin >>b[i];
   int k[2][p];
   for (int i=0;i<p;i++){
        k[0][i]=a[i%n];
   }
   for (int i=0;i<p;i++){
        k[1][i]=b[i%m];
   }
    for(int i=0;i<p;i++){
        if(k[0][i]==k[1][i])
             continue;
          switch(k[0][i]-k[1][i]){
             case 5:A++;break;
             case -3:A++;break;
             case -2:A++;break;
             default:B++;break;
        }
   }
   if(A>B)
       cout <<"A";
   else if(B>A)
       cout <<"B";
   else
       cout <<"draw";
}