Carrots. So. Many. Carrots
Minkolang 0.10, Befunge-93, &gt;&lt;&gt;; 3 2D languages, 321 bytes
v[1]: http://i.stack.imgur.com/mecHl.png
v[![][1]][1] 
&gt;\$$&gt;~:1+!#v_:&quot;^&quot;-#v_1&gt;:34*`#v_v
//  ^             ,&lt;0        &lt;    &gt;:0g,1+v
v#   ,,:*52&lt;          ^+1  ,g1:&lt;@_^#`*85:&lt;1
&gt;!v#(od&quot;^&quot;=,34*&amp;34*[i1+1qO]!O$I)lO58*[i1+0qO].
  &gt;i:0(?v:&quot;^&quot;-?v1&gt;:34*)?vv
  ^           o&lt;0       &lt; &gt; :0go1+v
  oo:*52&lt;        ^+1og1: &lt;^;?)*85:&lt;1

Interpreters: Minkolang, Befunge-93, &gt;&lt;&gt;.
I'll go into detail on each component if anyone wants, but what's important is that all of them read the first and second lines of the codebox and output the characters at the appropriate times. Also, I decide between Befunge and Minkolang/&gt;&lt;&gt; by the use of \, which swaps the top two values of the stack in the first and is a mirror in the other two. To separate Minkolang and &gt;&lt;&gt;, I use !v#. ! is an unconditional trampoline in both languages, but # is an omni-directional mirror in &gt;&lt;&gt; and a no-op in Minkolang. From then on, each language executes code in its own component.