Brain-Flak, 11 bytes
(((())))
Explanation
We need to put 3 things on the stack. The fastest way to do that is to put 3 1s (or zeros) on the stack. Now since (code point 1) does nothing in Brain-Flak we can add these to the program at the first middle and last places. Now this feels a bit cheaty so here are two more answers that are less cheaty in my opinion.
Prints braces, 3531 bytes
( ((()(((()()()()()){}){}){}))[()])
This answer prints braces so that the characters printed are actually relevant to the code, it does have one padding character to make the length odd so we only have to print 1 middle character.
Contains only braces, 3632 bytes
((((()(((()()()()()){}){}){}){})[()]))
This is a braces only program both the source and (consequently) the output are made up entirely of braces (character Brain-Flak actually cares about).