def modular_sum(arr, n, m):
	 
	if (n > m): 
		return True
	DP = [False for i in range(m)] 
	for i in range(n): 
		if (DP[0]): 
			return True
		temp = [False for i in range(m)] 
		for j in range(m): 
			if (DP[j] == True): 
				if (DP[(j + arr[i]) % m] == False): 
					temp[(j + arr[i]) % m] = True
		for j in range(m): 
			if (temp[j]): 
				DP[j] = True
		DP[arr[i] % m] = True
	return DP[0]
def modular_sum(arr, n, n2):
    if n > n2:
        return True
    DP = [False for i in range(n2)]
    for i in range(n):
        if DP[0]:
            return True
        temp = [False for i in range(n2)]
       
        for j in range(n2):
            if DP[j] == True:
                if DP[(j + arr[i]) % n2] == False:
                    temp[(j + arr[i]) % n2] = True
        for j in range(n2):
            if temp[j]:
                DP[j] = True
        DP[arr[i] % n2] = True
    return DP[0]