Can this language be defined by a Context Free Grammer?
You'll need to "wrap" the Bs in the Cs:

S -&gt; aaC
C -&gt; aCc | B
B -&gt; aBb | ɛ


With that, we have

$L(B) = a^m b^m$,

$L(C) = a^p \cdot L(B) \cdot c^p = a^p a^m b^m c^p$ and

$L(S) = a^2 \cdot L(C) = a^2 a^p a^m b^m c^p = a^{m+p+2} b^m c^p$.