B'The marmots need to prepare k problems for HC2 over n days. Each problem, once prepared, also has to be printed. The preparation of a problem on day i (at most one per day) costs ai CHF, and the printing of a problem on day i (also at most one per day) costs bi CHF. Of course, a problem cannot be printed before it has been prepared (but doing both on the same day is fine). What is the minimum cost of preparation and printing? The first line of input contains two space-separated integers n and k (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x892200). The second line contains n space-separated integers a1, xe2 x80 x89..., xe2 x80 x89an () -- the preparation costs. The third line contains n space-separated integers b1, xe2 x80 x89..., xe2 x80 x89bn () -- the printing costs. Output the minimum cost of preparation and printing k problems -- that is, the minimum possible sum ai1 xe2 x80 x89+ xe2 x80 x89ai2 xe2 x80 x89+ xe2 x80 x89... xe2 x80 x89+ xe2 x80 x89aik xe2 x80 x89+ xe2 x80 x89bj1 xe2 x80 x89+ xe2 x80 x89bj2 xe2 x80 x89+ xe2 x80 x89... xe2 x80 x89+ xe2 x80 x89bjk, where 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89i1 xe2 x80 x89< xe2 x80 x89i2 xe2 x80 x89< xe2 x80 x89... xe2 x80 x89< xe2 x80 x89ik xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89j1 xe2 x80 x89< xe2 x80 x89j2 xe2 x80 x89< xe2 x80 x89... xe2 x80 x89< xe2 x80 x89jk xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n and i1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89j1, i2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89j2, ..., ik xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89jk. In the sample testcase, one optimum solution is to prepare the first problem on day 1 and print it on day 1, prepare the second problem on day 2 and print it on day 4, prepare the third problem on day 3 and print it on day 5, and prepare the fourth problem on day 6 and print it on day 8. '...