import java.util.*;
import java.io.*;

public class ExtendSort {

	Scanner in = new Scanner(System.in);
	
	
	class NewChar {
		public char c;
		public int i;
		public boolean is_number;
		public NewChar(int j,boolean n) {
			if(n) i = j;
			else c = (char)j;
			is_number = n;
		}
		public String toString() {
			if(is_number) return "NUM: " + new Integer(i).toString();
			return new Character(c).toString();
		}
		public int compareTo(NewChar n) {
			if(is_number) {
				if(n.is_number) return i - n.i;
				return -1;
			}
			if(n.is_number) return 1;
			return new Character(c).toString().compareTo(new Character(n.c).toString());
		}
	} 
	
	public static void main(String[] args) {
		new ExtendSort().solve();
	}
	
	
	public void solve() {
		
		//System.out.println(new Character('-').toString().compareTo(new Character('+').toString()));
		
		//in = new Scanner("5\nx-3 X0001\n123-456-7890 123+456+7890\nxYz000123J XyZ+123j\n#$%^&*[]- abcdefgh\nAbc47jKL+00123 ABC+47jkL123");
		//in = new Scanner("1\n0--402 0--401");
		
		int num_cases = Integer.parseInt(in.nextLine());
		
		for(int case_num = 1; case_num <= num_cases; case_num++) {
			
			String[] str = in.nextLine().split(" ");
			ArrayList<NewChar> first = canon(str[0]);
			ArrayList<NewChar> sec = canon(str[1]);
			
			//if(case_num == 6) System.out.println("INPUT: " + str[0] + "     " + str[1]);
			
			int answer = 0;
			for(int i=0; i<first.size(); i++) {
				if(i >= sec.size()) {
					answer = 1;
				}
				//System.out.print(first.get(i) + "," + sec.get(i) + "|");
				int res = first.get(i).compareTo(sec.get(i));
				if(res < 0) {answer = -1; break;}
				if(res > 0) {answer = 1; break;}
			}
			if(answer == 0 && sec.size() > first.size()) answer = -1;
			
			//System.out.println();
			System.out.println(case_num + " " + answer);
		}
		
	}
	
	public ArrayList<NewChar> canon(String s) {
		
		ArrayList<NewChar> mine = new ArrayList<NewChar>();
		
		for(int i=0; i<s.length(); i++) {
			char c = s.charAt(i);
			
			if(c >= 'a' && c <= 'z') c += ('A'-'a');
			else {
				
				if(c == '+' || c == '-') {
					if(i != 0) {
						if(s.charAt(i-1) >= '0' && s.charAt(i-1) <= '9') {
							mine.add(new NewChar(c,false));
							continue;	// ignore if number before it
						}
					}
					else {
						if(s.length() <= i+1) {	// if the last character
							mine.add(new NewChar(c,false));
							continue;	// ignore if number before it
						}
						if(s.charAt(i+1) < '0' || s.charAt(i+1) > '9') {
							mine.add(new NewChar(c,false));
							continue;	// ignore if number before it
						}
					}
					
					// if i is zero and a number after it, ok
					// or if i is not the end
					int num = 0;
					while(i+1 < s.length() && s.charAt(i+1) >= '0' && s.charAt(i+1) <= '9') {
						num *= 10;
						num += s.charAt(i+1) - '0';
						if(s.charAt(i+1) == 'j') System.out.println("ERROR");
						i++;
						if(num  >= Integer.MAX_VALUE/100) break;
					}
					if(c == '-') num *= -1;
					mine.add(new NewChar(num,true));
					continue;
				}
				else if(c >= '0' && c <= '9') {
					int num = c - '0';
					while(i+1 < s.length()) {
						if(s.charAt(i+1) < '0' || s.charAt(i+1) > '9') {break;}
						num *= 10;
						num += s.charAt(i+1) - '0';
						i++;
						if(num  >= Integer.MAX_VALUE/100) break;
					}
					mine.add(new NewChar(num,true));
					continue;
				}
				
			}
			mine.add(new NewChar(c,false));
		}
		
		return mine;
	}
	
	
}