# [Brain-Flak], 396 bytes

    ((((((((((((((((((((((((((()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()())[()])[()])[()])[()])[()])[()])[()])[()])[()])[()])[()])[()])[()])[()])[()])[()])[()])[()])[()])[()])[()])[()])[()])[()])[()])

[Try it online!][TIO-k6yk1vu3]

[Brain-Flak]: https://github.com/Flakheads/BrainHack
[TIO-k6yk1vu3]: https://tio.run/##SypKzMzLSEzO/v9fAzfQHHlQM1pDM3bAiP///@s6AgA "Brain-Flak (BrainHack) – Try It Online"

## Explanation

This answer is pretty simple.  We push `z` by doing a bunch of `()`s

    ( () × 122 )

Then we use that as a starting place to count down each letter subtracting one each time.

    ( ... [()])

Where the `...` is the code that pushed all the letters prior.

The unfortunate thing is that the structure of the goal string actually makes it a lot harder to do anything fancy.  `[]` is basically useless since by the time we have anything on the stack we just want to count down.  And as if that weren't enough all of the fun operations `{...}`, `{}` and `<>` are unusable.

This answer is likely optimal for brain-flak (without using `-r`).