# The Book-shelver’s Problem

You are given a collection of books, which must be shelved in a library bookcase ordered (from top to bottom in the bookcase and from left to right in each shelf) by the books? catalogue numbers. The bookcase has a fixed width, but you may have any height you like. The books are placed on shelves in the bookcase in the usual upright manner (i.e., you cannot lay a book on its side). You may use as many shelves as you like, placed wherever you like up to the height of the bookcase, and you may put as many books on each shelf as you like up to the width of the bookcase. You may assume that the shelves have negligible thickness. Now, given an ordered (by catalogue numbers) list of the heights and widths of the books and the width of the bookcase, you are expected to determine what is the minimum height bookcase that can shelve all those books. Input The input file may contain multiple test cases. The first line of each test case contains an integer N(1 ≤ N ≤ 1000) that denotes the number of books to shelve, and a floating-point number W(0 < W ≤ 1000) that denotes the width of the bookcase in centimeters. Then follow N lines where the i − th (1 ≤ i ≤ N) line contains two floating-point numbers hi(0 < hi ≤ 100) and wi(0 < wi ≤ W) indicating the height and width (both in centimeters) of the i-th book in the list ordered by catalogue numbers. Each floating-point number will have four digits after the decimal point. A test case containing two zeros for N and W terminates the input. Output For each test case in the input print a line containing the minimum height (in centimeters, up to four digits after the decimal point) of the bookcase that can shelve all the books in the list. Sample Input 5 30.0000 30.0000 20.0000 20.0000 10.0000 25.0000 10.0000 30.0000 15.0000 10.0000 5.0000 10 20.0000 10.0000 2.0000 15.0000 10.0000 20.0000 5.0000 6.0000 2.0000 10.0000 3.0000 30.0000 6.0000 5.0000 3.0000 35.0000 2.0000 32.0000 4.0000 10.0000 6.0000 0 0.0000

2/2 Sample Output 60.0000 65.0000