This problem is given in two versions that differ only by constraints. If you can solve this problem in large constraints, then you can just write a single solution to the both versions. If you find the problem too difficult in large constraints, you can write solution to the simplified version only. Waking up in the morning, Apollinaria decided to bake cookies. To bake one cookie, she needs n ingredients, and for each ingredient she knows the value a i — how many grams of this ingredient one needs to bake a cookie. To prepare one cookie Apollinaria needs to use all n ingredients. Apollinaria has b i gram of the i -th ingredient. Also she has k grams of a magic powder. Each gram of magic powder can be turned to exactly 1 gram of any of the n ingredients and can be used for baking cookies. Your task is to determine the maximum number of cookies, which Apollinaria is able to bake using the ingredients that she has and the magic powder. The first line of the input contains two positive integers n and k ( 1 ≤ n , k ≤ 1000 ) — the number of ingredients and the number of grams of the magic powder. The second line contains the sequence a 1 , a 2 , ..., a n ( 1 ≤ a i ≤ 1000 ), where the i -th number is equal to the number of grams of the i -th ingredient, needed to bake one cookie. The third line contains the sequence b 1 , b 2 , ..., b n ( 1 ≤ b i ≤ 1000 ), where the i -th number is equal to the number of grams of the i -th ingredient, which Apollinaria has. Print the maximum number of cookies, which Apollinaria will be able to bake using the ingredients that she has and the magic powder. In the first sample it is profitably for Apollinaria to make the existing 1 gram of her magic powder to ingredient with the index 2 , then Apollinaria will be able to bake 4 cookies. In the second sample Apollinaria should turn 1 gram of magic powder to ingredient with the index 1 and 1 gram of magic powder to ingredient with the index 3 . Then Apollinaria will be able to bake 3