#include <iostream>#include <stdio.h>#include <string.h>#include <stack>#include <queue>#include <map>#include <set>#include <vector>#include <math.h>#include <algorithm>using namespace std;#define ls 2*i#define rs 2*i+1#define up(i,x,y) for(i=x;i<=y;i++)#define down(i,x,y) for(i=x;i>=y;i--)#define mem(a,x) memset(a,x,sizeof(a))#define w(a) while(a)#define LL long longconst double pi = acos(-1.0);#define Len 100005#define mod 1000000007int n,a1,h1,a2,h2;int main(){ scanf("%d",&n); w(n--) { scanf("%d%d%d%d",&a1,&h1,&a2,&h2); if(a1<=0) printf("Invalidn"); else { h1-=a2; h2-=a1; if(h1<=0) printf("Discard "); else printf("%d %d ",a1,h1); if(h2<=0) printf("Discardn"); else printf("%d %dn",a2,h2); } } return 0;}
