Carrots. So. Many. Carrots Damn, that's a lot of carrots.


The Inspiration



The Task

You must create a program, that, in as many languages as possible, replaces every instance of ^ with a markdown formatted link (meaning that if I was to post it in an answer, it would automatically read it as an image and place the image instead of the words) of this upward facing carrot.



How to Use Said Formatting:

First, anywhere in the file, put in the link like so (this is what I did for this question):

[1]: http://i.stack.imgur.com/mecHl.png

And then, wherever you want it:

[![][1]][1]

Rules


Standard Loopholes apply.
Input will be through STDIN or equivalent.
Output will be through STDOUT or equivalent.
Your code must be a fully operating program in all languages that you use.
The URL that you use for your carrot does not have to be the one in this answer. This was just an example. You may use any URL, provided that SE's Markdown shows this specific carrot with it.
This is a polyglot challenge, so the answer with the greatest amount of carrots languages wins!


In the case of a tie, the shortest code size of the entries with the largest number of languages wins.



EDIT:


Also, do NOT use trivial derivatives of languages! This means using a substitution language (Brainfuck vs. ShadyAsFuck) and different language versions (Python 2 vs. Python 3).



  There's a lot trivial esolangs to fit... (including 9001 BF variants)


Don't be that guy.

Note: Yes, this program will be slightly trivial in languages with regex support. However, the competition is to see how many languages the competitors can use.
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.