#include #include #include struct node { int jb[10]; int num; }ui[1005]; int main() { int M,N,n; int i; int u,b,a[100010]; char ch; while(scanf("%d%d",&M,&N)!=EOF) { memset(a,-1,sizeof(a)); memset(ui,0,sizeof(ui)); scanf("%d",&n); while(n--) { getchar(); scanf("%c",&ch); if(ch=='B') { scanf("%d %d",&u,&b); if(a[b]!=-1) { printf("The book is not in the library now\n"); } else { if(ui[u].num==9) { printf("You are not allowed to borrow any more\n"); } else { printf("Borrow success\n"); ui[u].jb[ui[u].num]=b; ui[u].num++; a[b]=u; } } } else if(ch=='R') { int j; scanf("%d",&b); if(a[b]==-1) { printf("The book is already in the library\n"); } else { int temp; int num; num=ui[a[b]].num; for(j=0;ji;--j) { if(ui[u].jb[i] > ui[u].jb[j]) { int t = ui[u].jb[i]; ui[u].jb[i]=ui[u].jb[j]; ui[u].jb[j] = t; } } } for(i=0;i