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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 200;
pair<int, int> dp[4][4][N + 1][N + 1];
const pair<int, int> poo = {0, 0};
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  for (int w = 0; w <= 2; w++)
    for (int l = 0; l <= 2; l++) {
      if (w + l == 0) {
        int i = 0, j = 0;
        int d = 25;
        for (int k = 0; k <= d - 2; k++)
          if (i + d <= N && j + k <= N) dp[w + 1][l][i + d][j + k] = {d, k};
        for (int k = d - 1; k <= N - max(i + 2, j); k++)
          dp[w + 1][l][i + k + 2][j + k] = {k + 2, k};
        for (int k = 0; k <= d - 2; k++)
          if (i + k <= N && j + d <= N) dp[w][l + 1][i + k][j + d] = {k, d};
        for (int k = d - 1; k <= N - max(i, j + 2); k++)
          dp[w][l + 1][i + k][j + k + 2] = {k, k + 2};
      } else {
        int d = w + l == 4 ? 15 : 25;
        for (int i = 0; i <= N; i++)
          for (int j = 0; j <= N; j++)
            if (dp[w][l][i][j] != poo) {
              for (int k = 0; k <= d - 2; k++)
                if (i + d <= N && j + k <= N)
                  dp[w + 1][l][i + d][j + k] = {d, k};
              for (int k = d - 1; k <= N - max(i + 2, j); k++)
                dp[w + 1][l][i + k + 2][j + k] = {k + 2, k};
              for (int k = 0; k <= d - 2; k++)
                if (i + k <= N && j + d <= N)
                  dp[w][l + 1][i + k][j + d] = {k, d};
              for (int k = d - 1; k <= N - max(i, j + 2); k++)
                dp[w][l + 1][i + k][j + k + 2] = {k, k + 2};
            }
      }
    }
  int m;
  cin >> m;
  while (m--) {
    int a, b;
    cin >> a >> b;
    bool ok = 0;
    for (auto [w, l] :
         {pair<int, int>{3, 0}, {3, 1}, {3, 2}, {2, 3}, {1, 3}, {0, 3}})
      if (dp[w][l][a][b] != poo) {
        cout << w << ':' << l << '\n';
        deque<pair<int, int> > bt;
        while (w + l) {
          auto [i, j] = dp[w][l][a][b];
          bt.push_front({i, j});
          a -= i;
          b -= j;
          (i > j ? w : l)--;
        }
        for (auto [i, j] : bt) cout << i << ':' << j << ' ';
        cout << '\n';
        ok = 1;
        break;
      }
    if (!ok) cout << "Impossible\n";
  }
}