Problem: Alice is a big fan of volleyball and especially of the very strong "Team A".

Volleyball match consists of up to five sets. During each set teams score one point for winning a ball. The first four sets are played until one of the teams scores at least 25 points and the fifth set is played until one of the teams scores at least 15 points. Moreover, if one of the teams scores 25 (or 15 in the fifth set) points while the other team scores 24 (or 14 in the fifth set), the set is played until the absolute difference between teams' points becomes two. The match ends when one of the teams wins three sets. The match score is the number of sets won by each team.

Alice found a book containing all the results of all matches played by "Team A". The book is old, and some parts of the book became unreadable. Alice can not read the information on how many sets each of the teams won, she can not read the information on how many points each of the teams scored in each set, she even does not know the number of sets played in a match. The only information she has is the total number of points scored by each of the teams in all the sets during a single match.

Alice wonders what is the best match score "Team A" could achieve in each of the matches. The bigger is the difference between the number of sets won by "Team A" and their opponent, the better is the match score. Find the best match score or conclude that no match could end like that. If there is a solution, then find any possible score for each set that results in the best match score.

Input

The first line contains a single integer m (1 ≤ m ≤ 50 000) — the number of matches found by Alice in the book.

Each of the next m lines contains two integers a and b (0 ≤ a, b ≤ 200) — the number of points scored by "Team A" and the number of points scored by their opponents respectively.

Output

Output the solution for every match in the same order as they are given in the input. If the teams could not score a and b points respectively, output "Impossible".

Otherwise, output the match score formatted as "x:y", where x is the number of sets won by "Team A" and y is the number of sets won by their opponent. 

The next line should contain the set scores in the order they were played. Each set score should be printed in the same format as the match score, with x being the number of points scored by "Team A" in this set, and y being the number of points scored by their opponent.

Example

Input


6
75 0
90 90
20 0
0 75
78 50
80 100


Output


3:0
25:0 25:0 25:0
3:1
25:22 25:22 15:25 25:21
Impossible
0:3
0:25 0:25 0:25
3:0
25:11 28:26 25:13
3:2
25:17 0:25 25:22 15:25 15:11

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class Solution{
	InputStream is;
	static PrintWriter out;
	String INPUT = "";
	static long mod = (long)1e9+7L;
	
	public void solve(){
		int a = ni(), b = ni();

		if(dp[0][0][a][b].loss == 5){
			out.println("Impossible");
			return;
		}
		else{
			out.println(dp[0][0][a][b].win+":"+dp[0][0][a][b].loss);
			for(int i = 0; i < (dp[0][0][a][b].res).size(); i=i+2){
				int x = (dp[0][0][a][b].res).get(i);
				int y = (dp[0][0][a][b].res).get(i+1);
				out.print(x+":"+y+" ");

			}
		}
		out.println();
	}
	
static boolean flag = false;
	
	static class DP{
		int vis, win, loss;
		LinkedList<Integer> res;
		DP(){
			vis = -1;
			win = 0; loss = 5;
			res = new LinkedList<Integer>();
		}

		public int compareTo(DP d){
			int v1 = this.win-this.loss;
			int v2 = d.win - d.loss;

			if(v1 < v2)return -1;
			else if(v1 > v2)return 1;
			else return 0;
		}
	}
	DP[][][][] dp;
	void run(){
		is = new DataInputStream(System.in);
		out = new PrintWriter(System.out);
		dp = new DP[7][4][201][201];
		for(int i = 0; i < 7; i++){
			for(int j = 0; j < 4; j++){
				for(int k = 0; k < 201; k++){
					for(int l = 0; l < 201; l++){
						dp[i][j][k][l] = new DP();
					}
				}
			}
		}

		for(int a = 0; a <= 200; a++){
			for(int b = 0; b <= 200; b++){
				LinkedList<Integer> ll = new LinkedList<Integer>();
				if(a == 90 && b == 90)flag = true;
				f(0, 0, a, b);
				flag = false;
			}
		}
		int t=ni();while(t-->0)solve();
		out.flush();
	}
	DP f(int M, int W, int a, int b){
		if(dp[M][W][a][b].vis != -1){
			return dp[M][W][a][b];
		}
		dp[M][W][a][b].vis = 1;
		int maxa = 0, maxb = 0;
		if(W == 3 || (M-W) == 3){
			if(a > 0 || b > 0)
				return dp[M][W][a][b];
			dp[M][W][a][b].win = W;
			dp[M][W][a][b].loss = M-W;
			return dp[M][W][a][b];
		}

		else{
			if(M == 4){
				boolean ok = false;
				if(a >= 15){
					for(int i = 0; i <= Math.min(13, b) && !ok; i++){
						DP subRes = f(M+1, W+1, a-15, b-i);
						if(subRes.compareTo(dp[M][W][a][b]) > 0){
							dp[M][W][a][b] = subRes;
							maxa = 15; maxb = i;
						}
						if((subRes.win - subRes.loss) == 3){
							ok = true;
						}
					}
					for(int i=16, j=14; i <= a && j <= b && !ok; i++, j++){
						DP subRes = f(M+1, W+1, a-i, b-j);
						if(subRes.compareTo(dp[M][W][a][b]) > 0){
							dp[M][W][a][b] = subRes;
							maxa = i; maxb = j;
						}
						if((subRes.win - subRes.loss) == 3){
							ok = true;
						}
					}
				}
				if(b >= 15){
					for(int i = 0; i <= Math.min(13, a) && !ok; i++){
						DP subRes = f(M+1, W, a-i, b-15);
						if(subRes.compareTo(dp[M][W][a][b]) > 0){
							dp[M][W][a][b] = subRes;
							maxa = i; maxb = 15;
						}
						if((subRes.win - subRes.loss) == 3){
							ok = true;
						}
					}
					for(int i=16, j=14; j <= a && i <= b && !ok; i++, j++){
						DP subRes = f(M+1, W, a-j, b-i);
						if(subRes.compareTo(dp[M][W][a][b]) > 0){
							dp[M][W][a][b] = subRes;
							maxa = j; maxb = i;
						}
						if((subRes.win - subRes.loss) == 3){
							ok = true;
						}
					}
				}
			}
			else{
				boolean ok = false;
				if(a >= 25){
					for(int i = 0; i <= Math.min(23, b) && !ok; i++){
						DP subRes = f(M+1, W+1, a-25, b-i);
						if(subRes.compareTo(dp[M][W][a][b]) > 0){
							dp[M][W][a][b] = subRes;
							maxa = 25; maxb = i;
						}
						if((subRes.win - subRes.loss) == 3){
							ok = true;
						}
					}
					for(int i=26, j=24; i <= a && j <= b && !ok; i++, j++){
						DP subRes = f(M+1, W+1, a-i, b-j);
						if(subRes.compareTo(dp[M][W][a][b]) > 0){
							dp[M][W][a][b] = subRes;
							maxa = i; maxb = j;
						}
						if((subRes.win - subRes.loss) == 3){
							ok = true;
						}
					}
				}
				if(b >= 25){
					for(int i = 0; i <= Math.min(23, a) && !ok; i++){
						DP subRes = f(M+1, W, a-i, b-25);
						if(subRes.compareTo(dp[M][W][a][b]) > 0){
							dp[M][W][a][b] = subRes;
							maxa = i; maxb = 25;
						}
						if((subRes.win - subRes.loss) == 3){
							ok = true;
						}
					}
					for(int i=26, j=24; j <= a && i <= b && !ok; i++, j++){
						DP subRes = f(M+1, W, a-j, b-i);
						if(subRes.compareTo(dp[M][W][a][b]) > 0){
							dp[M][W][a][b] = subRes;
							maxa = j; maxb = i;
						}
						if((subRes.win - subRes.loss) == 3){
							ok = true;
						}
					}
				}
			}
		}
		DP ans = new DP();
		if(dp[M][W][a][b].loss == 5){
			return dp[M][W][a][b];
		}
		else{
			ans.vis = 1;
			(ans.res).add(maxa);
			(ans.res).add(maxb);
			for(Integer elem : dp[M][W][a][b].res){
				int val = (int)elem;
				ans.res.add(val);
			}
			ans.win = dp[M][W][a][b].win;
			ans.loss = dp[M][W][a][b].loss;
		}
		return dp[M][W][a][b] = ans;
	}
	public static void main(String[] args)throws Exception{new Solution().run();}
	long mod(long v, long m){if(v<0){long q=(Math.abs(v)+m-1L)/m;v=v+q*m;}return v%m;}
    long mod(long v){if(v<0){long q=(Math.abs(v)+mod-1L)/mod;v=v+q*mod;}return v%mod;}
	//Fast I/O code is copied from uwi code.
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	private int readByte(){
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	private String ns(){
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	private char[] ns(int n){
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	private char[][] nm(int n, int m){
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	private int[] na(int n){
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	private int ni(){
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	private long nl(){
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	static  int i(long x){return (int)Math.round(x);}
	static class Pair implements Comparable<Pair>{
		long fs,sc;
		Pair(long a,long b){
			fs=a;sc=b;
		}
		public int compareTo(Pair p){
			if(this.fs>p.fs)return 1;
			else if(this.fs<p.fs)return -1;
			else{
				return i(this.sc-p.sc);
			}
			//return i(this.sc-p.sc);
		}
		public String toString(){
			return "("+fs+","+sc+")";
		}	
	}
	
}