#include <bits/stdc++.h>
using namespace std;
void read(int &x) {
  int v = 0, f = 1;
  char c = getchar();
  while (!isdigit(c) && c != '-') c = getchar();
  if (c == '-')
    f = -1;
  else
    v = v * 10 + c - '0';
  while (isdigit(c = getchar())) v = v * 10 + c - '0';
  x = v * f;
}
void read(long long &x) {
  long long v = 0ll, f = 1ll;
  char c = getchar();
  while (!isdigit(c) && c != '-') c = getchar();
  if (c == '-')
    f = -1;
  else
    v = v * 10 + c - '0';
  while (isdigit(c = getchar())) v = v * 10 + c - '0';
  x = v * f;
}
void readc(char &x) {
  char c;
  while ((c = getchar()) == ' ')
    ;
  x = c;
}
void writes(string s) { puts(s.c_str()); }
void writeln() { writes(""); }
void writei(int x) {
  if (x < 0) {
    putchar('-');
    x = abs(x);
  }
  if (!x) putchar('0');
  char a[25];
  int top = 0;
  while (x) {
    a[++top] = (x % 10) + '0';
    x /= 10;
  }
  while (top) {
    putchar(a[top]);
    top--;
  }
}
void writell(long long x) {
  if (x < 0) {
    putchar('-');
    x = abs(x);
  }
  if (!x) putchar('0');
  char a[25];
  int top = 0;
  while (x) {
    a[++top] = (x % 10) + '0';
    x /= 10;
  }
  while (top) {
    putchar(a[top]);
    top--;
  }
}
inline long long inc(int &x) { return ++x; }
inline long long inc(long long &x) { return ++x; }
inline long long inc(int &x, long long y) { return x += y; }
inline long long inc(long long &x, long long y) { return x += y; }
inline double inc(double &x, double y) { return x += y; }
inline long long dec(int &x) { return --x; }
inline long long dec(long long &x) { return --x; }
inline long long dec(int &x, long long y) { return x -= y; }
inline long long dec(long long &x, long long y) { return x -= y; }
inline double dec(double &x, double y) { return x -= y; }
inline long long mul(int &x) { return x = ((long long)x) * x; }
inline long long mul(long long &x) { return x = x * x; }
inline long long mul(int &x, long long y) { return x *= y; }
inline long long mul(long long &x, long long y) { return x *= y; }
inline double mul(double &x, double y) { return x *= y; }
inline long long divi(const int &x) {
  long long ans, l, r, mid;
  ans = 0;
  l = 0;
  r = 0x3fffffff;
  while (l < r) {
    mid = (l + r) / 2;
    if (mid * mid <= x) {
      ans = mid;
      l = mid + 1;
    } else
      r = mid;
  }
  return ans;
}
inline long long divi(const long long &x) {
  long long ans, l, r, mid;
  ans = 0;
  l = 0;
  r = 0x3fffffff;
  while (l < r) {
    mid = (l + r) / 2;
    if (mid * mid <= x) {
      ans = mid;
      l = mid + 1;
    } else
      r = mid;
  }
  return ans;
}
inline long long divi(int &x, long long y) { return x /= y; }
inline long long divi(long long &x, long long y) { return x /= y; }
inline double divi(double &x, double y) { return x /= y; }
inline long long mod(int &x, long long y) { return x %= y; }
inline long long mod(long long &x, long long y) { return x %= y; }
int n, m, i, j, k, l, p, q, lt1[5][5][215][215], lt2[5][5][215][215];
vector<pair<int, int> > ans;
bool cmp(pair<int, int> x, pair<int, int> y) {
  return x.first - x.second < y.first - y.second;
}
void print(int i, int j, int x, int y) {
  if (i == 0 && j == 0) return;
  int f, g;
  ans.push_back(make_pair(f = lt1[i][j][x][y], g = lt2[i][j][x][y]));
  if (f > g)
    i--;
  else
    j--;
  print(i, j, x - f, y - g);
}
int main() {
  memset(lt1, -1, sizeof(lt1));
  lt1[0][0][0][0] = 0;
  for (i = 0; i <= 2; i++) {
    for (j = 0; j <= 2 && i + j < 5; j++) {
      if ((0) <= (200))
        for ((k) = (0); (k) <= (200); (k)++)
          if ((0) <= (200))
            for ((l) = (0); (l) <= (200); (l)++)
              if (lt1[i][j][k][l] != -1) {
                int f = 15 + (i + j != 4) + (i + j != 4) + (i + j != 4) +
                        (i + j != 4) + (i + j != 4) + (i + j != 4) +
                        (i + j != 4) + (i + j != 4) + (i + j != 4) +
                        (i + j != 4);
                for (p = 0; l + p <= 200; p++) {
                  q = max(f, p + 2);
                  if (k + q <= 200) {
                    lt1[i + 1][j][k + q][l + p] = q;
                    lt2[i + 1][j][k + q][l + p] = p;
                  }
                }
                for (p = 0; k + p <= 200; p++) {
                  q = max(f, p + 2);
                  if (l + q <= 200) {
                    lt1[i][j + 1][k + p][l + q] = p;
                    lt2[i][j + 1][k + p][l + q] = q;
                  }
                }
              }
    }
  }
  read(n);
  while (n--) {
    int x, y;
    read(x);
    read(y);
    ans.clear();
    for (i = 0; i <= 2; i++) {
      if (lt1[3][i][x][y] != -1) {
        print(3, i, x, y);
        reverse((ans).begin(), (ans).end());
        printf("3:%d\n", i);
        for (__typeof((ans).begin()) it = (ans).begin(); it != (ans).end();
             it++)
          printf("%d:%d ", it->first, it->second);
        puts("");
        break;
      }
    }
    if (i <= 2) continue;
    for (i = 2; i >= 0; i--) {
      if (lt1[i][3][x][y] != -1) {
        print(i, 3, x, y);
        reverse((ans).begin(), (ans).end());
        printf("%d:3\n", i);
        for (__typeof((ans).begin()) it = (ans).begin(); it != (ans).end();
             it++)
          printf("%d:%d ", it->first, it->second);
        puts("");
        break;
      }
    }
    if (i >= 0) continue;
    puts("Impossible");
  }
  return 0;
}
