time limit per test : 1 second
memory limit per test : 256 megabytes

Dima, Inna and Seryozha have gathered in a room. That’s right, someone’s got to go. To cheer Seryozha up and inspire him to have a walk, Inna decided to cook something.

Dima and Seryozha have n fruits in the fridge. Each fruit has two parameters: the taste and the number of calories. Inna decided to make a fruit salad, so she wants to take some fruits from the fridge for it. Inna follows a certain principle as she chooses the fruits: the total taste to the total calories ratio of the chosen fruits must equal k. In other words,

, where aj is the taste of the j-th chosen fruit and bj is its calories.

Inna hasn’t chosen the fruits yet, she is thinking: what is the maximum taste of the chosen fruits if she strictly follows her principle? Help Inna solve this culinary problem — now the happiness of a young couple is in your hands!

Inna loves Dima very much so she wants to make the salad from at least one fruit.

Input

The first line of the input contains two integers $n,k(1$

  ≤   n   ≤   100 ,   1   ≤   k   ≤   10 ) n, k (1 ≤ n ≤ 100, 1 ≤ k ≤ 10) . The second line of the input contains n integers $a_1, a_2, ..., a_n (1 ≤ a_i ≤ 100)$ — the fruits’ tastes. The third line of the input contains n integers $b_1, b_2, ..., b_n (1 ≤ b_i ≤ 100)$ — the fruits’ calories. Fruit number i has taste ai and calories $b_i$.

Output

If there is no way Inna can choose the fruits for the salad, print in the single line number $-1$. Otherwise, print a single integer — the maximum possible sum of the taste values of the chosen fruits.

Input

3 2
10 8 1
2 7 1

Output

18

Input

5 3
4 4 4 4 4
2 2 2 2 2

Output

-1

Note

In the first test sample we can get the total taste of the fruits equal to 18 if we choose fruit number 1 and fruit number 2, then the total calories will equal 9. The condition fulfills, that’s exactly what Inna wants.

In the second test sample we cannot choose the fruits so as to follow Inna’s principle.

題意：
給 $n$個元素，第 $j$個元素有兩個性質 $a_j$和 $b_j$，從中選出 $m$個元素，使得若不存在方案符合，則輸出-1，否則輸出最大的sigma( $a_i$)。

題解：
將 $b_j$設為 $a_j-k*b_j$
然後就是裸的01揹包問題了
物品大小可能為負數，要用到map

#include<bits/stdc++.h>
#define LiangJiaJun main
#define POS(a,b) (a*10001+b)
using namespace std;
int n,k;
int a[104],b[104];
map<int,int>mert,val;
int w33ha(){
    map<int,int>::iterator it;
    mert.clear();
    val.clear();
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    for(int i=1;i<=n;i++){
        scanf("%d",&b[i]);
        b[i]=a[i]-k*b[i];
    }
    val[0]=0;
    for(int i=1;i<=n;i++){
        mert=val;
        for(it=mert.begin();it!=mert.end();it++){
            val[(it->first)+b[i]]=max(val[(it->first)+b[i]],(it->second)+a[i]);
        }
    }
    if(val[0]==0)puts("-1");
    else printf("%d\n",val[0]);
    return 0;
}
int LiangJiaJun(){
    while(scanf("%d%d",&n,&k)!=EOF)w33ha();
    return 0;
}