Apples and Bananas

There are n apples and m bananas, and each of them has an integer weight between 1 \ldots k. Your task is to calculate, for each weight w between 2 \dots 2k, the number of ways we can choose an apple and a banana whose combined weight is w. Input The first input line contains three integers k, n and m: the number k, the number of apples and the number of bananas. The next line contains n intege