B"Everyone knows that computers become faster and faster. Recently Berland scientists have built a machine that can move itself back in time! More specifically, it works as follows. It has an infinite grid and a robot which stands on one of the cells. Each cell of the grid can either be empty or contain 0 or 1. The machine also has a program which consists of instructions, which are being handled one by one. Each instruction is represented by exactly one symbol (letter or digit) and takes exactly one unit of time (say, second) to be performed, except the last type of operation (it's described below). Here they are: For example, let the board be completely empty, and the program be sr1t0. Let the robot initially be at (0, 0) . Now Berland scientists want to use their machine in practice. For example, they want to be able to add two integers. Assume that the initial state of the machine is as follows: You are asked to write a program after which Note that there are no restrictions on other cells. In particular, there may be a digit just to the left to the robot after all instructions. In each test you are given up to 1000 pairs (a, b) , and your program must work for all these pairs. Also since the machine's memory is not very big, your program must consist of no more than 10^5 instructions. The first line contains the only integer t ( 1 <= t <= 1000 ) standing for the number of testcases. Each of the next t lines consists of two positive integers a and b ( 1 <= a, b < 2^{30} ) in decimal. Output the only line consisting of no more than 10^5 symbols from 01eslrudt standing for your program. Note that formally you may output different programs for different tests. "...