OpenJudge - 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.

翻译：

有N个书包，每个书包都有一些糖果。你可以带一些包。这些包里糖果的总数应该是K的倍数因为你想要把这些糖果平分给K个朋友。你最多可以带多少糖果呢？

输入：

第一行：两个正整数N和K。

第二行:N个正整数。

输出：

一个数。