Ɗ - Last Three As Monad
The resulting link is monadic, meaning it takes one argument. Note that the arity refers to that of the resulting link, not the number of links this quick consumes.
Combine three links (that aren't part of an LCC) into one monad.
Scanning backwards, if the chain starting at that point is not an LCC, increment a counter. Once the counter reaches three, return those links combined into a monad.
<link><link><link>Ɗ- combine links into one monad