Geek currently has skill $s$ and $d$ days left for placements. He has

a array problems of $n$ problems where $i^{th}$ problem is

represented as problems$[$i$]=\{$rating ${?}_i,$ gain $\{$:${?}_i\}.$ Geek could solve the

$i^{th}$ problem only if his currenty skill is not smaller than the

rating. And solving $i^{th}$ problem will increase geek's skill by the

gain ${?}_i.$

Geek wants his skill to get maximised because the placement

season is near. Find the maximum rating Geek could reach if he

could solve only one problem in a day, if there are problems that

he could solve.

Example $1$:

Input:

$s=25$

$n=3$

$d=3$

problems $=\{\{35,45\},\{13,6\},\{100,4\}\}$

Output: