Is this language L context-free?
A more precise expression of the condition "$x$ is a contiguous substring of $y$" produces

$$L = \{x^r \# wxz | x, w, z\in \{a, b, c\}^*\}$$

That should make it clear that the language is context-free.