Pumping lemma for regular languages vs. Pumping lemma for context-free languages

How can I prove the next claim:

If a language $ L$ meets the pumping lemma for regular languages then $ L$ meets the pumping lemma for context-free languages?

(Without any pre-condition about the regularity of $ L$ )