Determine whether the following language is CFG(context free language)

If its not prove by pumping lemma

L1 = {aⁿb^mc^k d^r | 2n = 3k and 5m = 7r}