Regular Language $a^n b^m c^k$ to Context free grammar
Let us get things straight...the language $L$ is not regular (you can check using Pumping lemma) Although the language is Context Free as it is the union of two CFLs.

The grammar does not correspond to the language since the non-terminal $B$ can not be terminated. So  only way to termiante it and get a word of the language is $S=A^*$. But $A=aAb=aAcb=aabcb\notin L$

Correct grammar should be 

$$S\to A|B$$
$$A\to Ac|aAb|\lambda$$
$$B\to aB|bBc|Bc|\lambda$$

Two non terminals $A$ and $B$ for the two CFLs whose union is $L$.