english-31 Candies

描述

There are N bags. Each bag has some candies. You can take some of the bags. the total number of candies in these bags should be a multiple of K because you want to divide the candies equally between K friends. How many candies can you take at most?

输入

First line: two positive integers N (N <= 100) and K (K <= 1000).Second line: N positive integers (<= 1000).

输出

One integer.

样例输入

1
25 3
4 1 5 3 1

样例输出

112

限制

• 时间限制：1000ms
• 内存限制：128MB