Your challenge is to output the highest number you can. You can output as a number or as a string. You must output something that matches the regex
^\d+$, as in only 0-9.
Your source code must be:
Same forwards and backwards
3 bytes long
The middle byte must be different from the other two
0_0 )-) m.m xvx W$W @\@
mnop l__l ___ T_+ O_o 0_o
Snippets are allowed, you don't need a full program / function.