Finding a lower bound in terms of given integers @BorisBukh: Usually for Baker type methods to work, one fixes some algebraic irrational, and then considers approximations of suitably large height. I don't immediately see how that leads to anything better than Fedor Petrov's comment above to the problem at hand (in the general situation where $n$, $m$ and $l$ may all be large).