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 wondered whether a text can be written so that it reads correctly both ways. In programming class he kept thinking about this too, and now he wants code that solves the tasks when read by rows (top to bottom and left to right) and when read by columns (left to right and top to bottom). For experiments he chose a language called BF.

The memory of a BF program is an infinite array $M$ with cells numbered from left to right ($M_0$, $M_1$, \ldots). Each cell contains a nonnegative integer that can be arbitrarily large. At the beginning of execution, the data pointer points to the leftmost cell ($M_0$).

Execution starts from the first command. After each command, the program moves on to the next command in the sequence. There are six commands, each 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 N$ grid of BF program code (where $1 \le N \le 1000$). The code does not have to be the same when read by rows and by columns, but it must solve the task correctly in both cases. The solution text can only contain the characters >, <, +, -, [ and ], and it must completely fill the grid. For any allowed input, the code must not execute more than $10$ million commands.

Task: The cells $M_0$ and $M_1$ of the array contain the integers $x$ and $y$ ($0 \le y \le x \le 200$), and all other cells contain zeros. Write the difference $x-y$ into the cell $M_0$.

In the output, only the value in cell $M_0$ matters: it must be the difference of $x$ and $y$ (in this case, $7 - 5 = 2$). Other cells may contain any numbers (for example, $1500$, $0$, $42$, \ldots).