uva 978

利用優先佇列完成，這題應該偏模擬實做題

不過優先佇列應該可以更快，記得不要立即更新，否則會馬上取戰鬥完的旅鼠來戰鬥

//====================================================================||
//                                                                    ||
//                                                                    ||
//                         Author : GCA                               ||
//                  6AE7EE02212D47DAD26C32C0FE829006                  ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <functional>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 100005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
int sg,sb,ba;

int main() {
    ios_base::sync_with_stdio(0);
    int test;
    scanf("%d",&test);
    while(test--){
        priority_queue<int,vector<int>,less<int> > g,b;
        scanf("%d%d%d",&ba,&sg,&sb);
        for(int i=0;i<sg;i++){
            int t;
            scanf("%d",&t);
            g.push(t);
        }
        for(int i=0;i<sb;i++){
            int t;
            scanf("%d",&t);
            b.push(t);
        }
        int whowin=0;
        vector<int> tg,tb;
        while(1){
            if(g.empty()&&b.empty()){
                break;
            }else if(g.empty()){
                whowin=2;
                break;
            }else if(b.empty()){
                whowin=1;
                break;
            }
            int t=min3(ba,g.size(),b.size());

            for(int i=0;i<t;i++){
                int x=g.top(),y=b.top();g.pop();b.pop();
//                debug("%d %d\n",x,y);
                if(x>y)tg.PB(x-y);
                else if(x<y)tb.PB(y-x);
            }
            for(int i=0;i<tg.size();i++)g.push(tg[i]);
            for(int i=0;i<tb.size();i++)b.push(tb[i]);
            tg.clear();tb.clear();
        }
        if(whowin==0)printf("green and blue died\n");
        else if(whowin==1){
            printf("green wins\n");
            while(!g.empty()){
                printf("%d\n",g.top());
                g.pop();
            }
        }
        else{
            printf("blue wins\n");
            while(!b.empty()){
                printf("%d\n",b.top());
                b.pop();
            }
        }
        if(test)Pln();
    }

















}