import sys
maxmod = 0

def DFS(start,currrent_sum):
    global maxmod
    if currrent_sum%m > maxmod:
        maxmod = currrent_sum%m
    for i in range(start,n):
        currrent_sum += a[i]
        DFS(i+1,currrent_sum)
        currrent_sum -= a[i]



n , m = map(int,input().split())
a = list(map(int,input().split()))

DFS(0,0)
print(maxmod)