On the equation \((x+1)\dots(x+k)=(y+1)\dots(y+mk)\) (Q1190263)

In the second article [for the first one, ibid. 2, No. 4, 489-510 (1991) see the review above] the authors show that the equation \[ (x+1)\dots(x+k)=(y+1)\dots (y+mk) \] with integers \(x,y\geq 0\), \(k,m\geq 2\) implies that \(\max(x,y,k)\) is bounded by an effectively computable number depending only on \(m\). In an appendix by R. Balasubramanian, some relations, not necessary for the proof, of the implied polynomials are given.