Problem: Fibonacci numbers are the sequence of integers: f0 = 0, f1 = 1, f2 = 1, f3 = 2, f4 = 3, f5 = 5, ..., fn = fn - 2 + fn - 1. So every next number is the sum of the previous two.

Bajtek has developed a nice way to compute Fibonacci numbers on a blackboard. First, he writes a 0. Then, below it, he writes a 1. Then he performs the following two operations:

  * operation "T": replace the top number with the sum of both numbers; 
  * operation "B": replace the bottom number with the sum of both numbers. 



If he performs n operations, starting with "T" and then choosing operations alternately (so that the sequence of operations looks like "TBTBTBTB..."), the last number written will be equal to fn + 1.

Unfortunately, Bajtek sometimes makes mistakes and repeats an operation two or more times in a row. For example, if Bajtek wanted to compute f7, then he would want to do n = 6 operations: "TBTBTB". If he instead performs the sequence of operations "TTTBBT", then he will have made 3 mistakes, and he will incorrectly compute that the seventh Fibonacci number is 10. The number of mistakes in the sequence of operations is the number of neighbouring equal operations («TT» or «BB»).

You are given the number n of operations that Bajtek has made in an attempt to compute fn + 1 and the number r that is the result of his computations (that is last written number). Find the minimum possible number of mistakes that Bajtek must have made and any possible sequence of n operations resulting in r with that number of mistakes.

Assume that Bajtek always correctly starts with operation "T".

Input

The first line contains the integers n and r (1 ≤ n, r ≤ 106).

Output

The first line of the output should contain one number — the minimum possible number of mistakes made by Bajtek. The second line should contain n characters, starting with "T", describing one possible sequence of operations with that number of mistakes. Each character must be either "T" or "B".

If the required sequence doesn't exist, output "IMPOSSIBLE" (without quotes).

Examples

Input

6 10


Output

2
TBBTTB


Input

4 5


Output

0
TBTB


Input

2 1


Output

IMPOSSIBLE

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MODULO = 1000000007;
const int INF = 100000000;
using namespace std;
int dp[1000000];
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
pair<int, int> get_count(int l, int r) {
  if (l == 0) return pair<int, int>(0, 0);
  int nr = r / l;
  pair<int, int> ret = get_count(r % l, l);
  ret.first += nr;
  ret.second += nr - 1;
  return ret;
}
string solve(int n, int r) {
  if (n == 1) {
    if (r == 1)
      return "0\nT";
    else
      return "IMPOSSIBLE";
  } else if (n == 2) {
    if (r == 2)
      return "0\nTB";
    else
      return "IMPOSSIBLE";
  }
  int ans = INF;
  int mn = INF;
  for (int i = 1; i < r; i++) {
    if (gcd(i, r) != 1) continue;
    pair<int, int> c = get_count(i, r);
    c.second -= 2;
    if (c.first == n) {
      if (ans > c.second) {
        ans = c.second;
        mn = i;
      }
    }
  }
  if (mn == INF) return "IMPOSSIBLE";
  string ret = "";
  int a = mn, b = r;
  int c = 0;
  while (a != 0) {
    ret += string(b / a, (c & 1) ? 'T' : 'B');
    b %= a;
    swap(a, b);
    c++;
  }
  if (ret[0] == ret[1]) ret[0] = (ret[0] == 'T') ? 'B' : 'T';
  ret[ret.size() - 1] = (ret[ret.size() - 1] == 'T') ? 'B' : 'T';
  reverse(ret.begin(), ret.end());
  if (ret[0] == 'B') {
    for (int i = 0; i < (ret.size()); i++) ret[i] = (ret[i] == 'T') ? 'B' : 'T';
  }
  ans = 0;
  for (int i = 0; i < (ret.size() - 1); i++) {
    ans += (ret[i] == ret[i + 1]);
  }
  char buf[256];
  sprintf(buf, "%d\n", max(ans, 0));
  string ret2(buf);
  return ret2 + ret;
}
int main() {
  int n, r;
  cin >> n >> r;
  cout << solve(n, r) << endl;
  return 0;
}