Magical BF 1

문제

John learned at school that in many East Asian languages texts can be written from left to right as well as from top to bottom. He got especially curious whether it's possible to write a text such that it can simultaneously be read both ways. John kept puzzling in programming class as well and now wants to write code such that it would solve the tasks when read by rows (top to bottom and left to right), as well as when read by columns (left to right and top to bottom). Naturally, he needed a suitable language for this and John chose a language called BF for experimenting.

The memory of a BF program is an infinite array $MM$ with cells numbered from left to right ($M_{0}M\_0$, $M_{1}M\_1$, \ldots). Each cell contains a nonnegative integer that can be arbitrarily large. Additionally there is a data pointer that in the beginning of execution points to the leftmost cell ($M_{0}M\_0$).

The execution of a program starts from its first command and in general after the execution of each command the program moves on to the next command in the sequence. Altogether there are six commands in the language, each one denoted by one character:

Help John write magical BF programs for solving the five tasks listed below.

As a solution to each task submit an $N\times NN\; \backslash times\; N$ grid of BF program code (where $1\le N\le 10001\; \backslash le\; N\; \backslash le\; 1000$). The code does not have to be the same when read by rows and by columns, but must solve the task correctly in both cases. The solution text can only contain the characters '>', '<', '+', '-', '[' and ']' and must completely fill the grid. For any allowed input, the code must not execute more than $1010$ million commands.

Task: The cells $M_{0}M\_0$ and $M_{1}M\_1$ of the array contain the integers $xx$ and $yy$ ($0\le y\le x\le 2000\; \backslash le\; y\; \backslash le\; x\; \backslash le\; 200$), all other cells contain zeros. Write the difference $x-yx-y$ into the cell $M_{0}M\_0$.

Input example: [이미지 1]

Output example: [이미지 2]

In the output, it only matters that the cell $M_{0}M\_0$ contains the difference of $xx$ and $yy$ (in this case, $7-5=27\; -\; 5\; =\; 2$), other cells may contain any numbers (for example, $15001500$, $00$, $4242$, \ldots).