  We use new bounds of double exponential sums with ratios of integers from
prescribed intervals to get an asymptotic formula for the number of solutions
to congruences $$ \sum_{j=1}^n a_j x_jy_j^{-1} \equiv a_0 \pmod p, $$ with
variables from rather general sets.
