```# [COW], 183 bytes

oomMMMmoOMMMmoOoomMMMmoOMMMmOomOoMMMmoOmoOmoOMMMMMMmoOMMMmOomOoMMMmoOmoOmoOMMMMMMmoOMMMmOoMOOmOomOomOomOomOomOoMOOMOomoOmoOMOOMoOmoOmoOMOOMoOmoOmoOMOoMMMOOOmooOOOmooOOOmooMMMmoomoOOOM

[Try it online!][TIO-krm7a0sv]

## How

Returns the smaller integer.
It increases and decreases both, the first (with precedence to the decreasing one) to reach **0** is the smaller.

```
[0]: n to be decreased   [1]: n   [2]: m to be increased   [3]: m   [4]: n to be increased   [5]: n   [6]: m to be decreased   [7]: m

i=>=>i=>=<<=>>>==>=<<=>>>==>=<    | set up memory cells as above
[                                 | loop until a cell reaches 0
<<<<<<[->>[+>>[+>>-=*]*]*]=   | [0]-- [2]++ [4]++ [6]--
]>o                               |	print the redundant copy of the smaller

moo ]    mOo <    MOo -    OOO °    OOM i
MOO [    moO >    MoO +    MMM =    oom o
```

[COW]: https://bigzaphod.github.io/COW/
[TIO-krm7a0sv]: https://tio.run/##jUyxDcAwDNp7TXsI4ojOEWPOd0iQqmSrhSywgVe9SmoAmph9SMqIDLDm5xdkPDt8hEn85l/24LOWjkv7XuUza2/VfT0D "COW – Try It Online"```