Problem:
 Score : 300 points    Problem Statement Given are positive integers N , M , Q , and Q quadruples of integers ( a_i , b_i , c_i , d_i ).  Consider a sequence A satisfying the following conditions:   A is a sequence of N positive integers.  1 \leq A_1 \leq A_2 \le \cdots \leq A_N \leq M .   Let us define a score of this sequence as follows:   The score is the sum of d_i over all indices i such that A_{b_i} - A_{a_i} = c_i . (If there is no such i , the score is 0 .)   Find the maximum possible score of A .      Constraints  All values in input are integers.  2 ≤ N ≤ 10  1 \leq M \leq 10  1 \leq Q \leq 50  1 \leq a_i < b_i \leq N ( i = 1, 2, ..., Q )  0 \leq c_i \leq M - 1 ( i = 1, 2, ..., Q )  (a_i, b_i, c_i) \neq (a_j, b_j, c_j) (where i \neq j )  1 \leq d_i \leq 10^5 ( i = 1, 2, ..., Q )         Input Input is given from Standard Input in the following format:  N  M  Q  a_1  b_1  c_1  d_1  :  a_Q  b_Q  c_Q  d_Q       Output Print the maximum possible score of A .        Sample Input 1 3 4 3
1 3 3 100
1 2 2 10
2 3 2 10      Sample Output 1 110  When A = \{1, 3, 4\} , its score is 110 . Under these conditions, no sequence has a score greater than 110 , so the answer is 110 .       Sample Input 2 4 6 10
2 4 1 86568
1 4 0 90629
2 3 0 90310
3 4 1 29211
3 4 3 78537
3 4 2 8580
1 2 1 96263
1 4 2 2156
1 2 0 94325
1 4 3 94328      Sample Output 2 357500       Sample Input 3 10 10 1
1 10 9 1      Sample Output 3 1

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz')
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    
    
    N, M, Q = R()
    ABCD = [R() for i in range(Q)]
    task = [([1], 1)]
    ans = 0
    while task:
        l, max_val = task.pop()
        if len(l) == N+1:
            tmp = 0
            for a, b, c, d in ABCD:
                if l[b] - l[a] == c:
                    tmp += d
            ans = max(ans, tmp)
        else:
            for i in range(max_val, M+1):
                task.append((l+[i], max(i, max_val)))
    
    print(ans)

    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
import sys
sys.setrecursionlimit(10**9)

n, m, q = map(int, input().split())
val = [list(map(int, input().split())) for _ in range(q)]
ans = 0

def dfs(A):
  global ans
  if len(A) == n+1:
    score = 0
    for a,b,c,d in val:
      if A[b]-A[a] == c:
        score += d
    ans = max(ans, score)
  else:
    A.append(A[-1])
    while(A[-1] <= m):
      dfs(A.copy())
      A[-1] += 1
A = [1]
dfs(A)
print(ans)

Solution (Python):
def makeSeqList(N,M,curList,res):
    if len(curList)==N:
        res.append(curList.copy())
        return

    for i in range(1,M+1):
        if len(curList)!=0 and i<curList[-1]:
            continue
        curList.append(i)
        makeSeqList(N,M,curList,res)
        del curList[-1]

def main():
    N,M,Q=map(int,input().split())
    quadList=[]
    for _ in range(Q):
        quadList.append(list(map(int,input().split())))
    res=[]
    makeSeqList(N,M,[],res)
    ans=-1
    for sequence in res:
        summ=0
        for q in quadList:
            if (sequence[q[1]-1]-sequence[q[0]-1])==q[2]:
                summ+=q[3]
        ans=max(ans,summ)
    print(ans)

if __name__=='__main__':
    main()

Solution (Python):
import sys
input = sys.stdin.readline
from itertools import combinations_with_replacement
import copy
def f(A, x, N, M, A_list):
    if len(A) == N:
        A_list.append(A)
        return
    A.append(x)
    for i in range(x, M+1):
        A_copy = copy.copy(A)
        f(A_copy, i, N, M, A_list)
def main():
    N, M, Q = map(int, input().split())
    q_list = []
    for _ in range(Q):
        a, b, c, d = map(int, input().split())
        q_list.append((a, b, c, d))
    
    A_list = []
    f([], 1, N, M, A_list)
    ans = 0
    for Ai in A_list:
        v = 0
        Ai = list(map(int, Ai))
        for a, b, c, d in q_list:
            if Ai[b-1]-Ai[a-1] == c:v += d
        ans = max(ans, v)
    print(ans)
if __name__ == "__main__":
    main()

Solution (Python):
N, M, Q = list(map(int, input().split()))
a = [0]*Q
b = [0]*Q
c = [0]*Q
d = [0]*Q
for i in range(Q):
  a[i], b[i], c[i], d[i] = list(map(int, input().split()))
li = [1]*11
ans = 0

def countup(l, n, m):
  l[n] += 1
  if l[n] > m:
    if n == 0:
      return
    countup(l, n-1, m)
    l[n] = l[n-1]
  return

while(li[0]==1):
  pt = 0
  for i in range(Q):
    if (li[b[i]]-li[a[i]]==c[i]):
      pt += d[i]
  ans = max(ans, pt)
  countup(li, N, M)

print(ans)

Solution (Python):
import itertools
N,M,Q = map(int, input().split())
a = [0]*Q
b = [0]*Q
c = [0]*Q
d = [0]*Q
for i in range(Q):
    a[i],b[i],c[i],d[i] = map(int, input().split())

ans = 0

for L in list(itertools.combinations_with_replacement(range(1,M+1),N)):
    now = 0
    for i in range(Q):
        if L[b[i]-1] - L[a[i]-1] == c[i]:
            now += d[i]
    ans = max(ans, now)

print(ans)

Solution (Python):
import sys
import os
import math
import bisect
import collections
import itertools

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N, M, Q = il()
    abcd = [il() for _ in range(Q)]

    ret = 0
    for i in itertools.combinations_with_replacement(range(1, M + 1), N):
        tmp = 0
        for a, b, c, d in abcd:
            if i[b - 1] - i[a - 1] == c: tmp += d

        ret = max(ret, tmp)

    print(ret)


if __name__ == '__main__':
    main()

Solution (Python):
import sys
import copy
from collections import deque


def main():
    N, M, Q = map(int, input().split())
    ABCD = [[int(_) for _ in input().split()] for i in range(Q)]

    seq_list = make_sequence(N, M)
    
    max_score = 0
    for i_seq in seq_list:
        score = 0
        for a, b, c, d in ABCD:
            if (i_seq[b-1] - i_seq[a-1]) == c:
                score += d
        
        max_score = max(max_score, score)

    print(max_score)
    return


def make_sequence(N, M):
    seq_list = []
    sequence = [-1] * N

    seq_deque = deque()
    now_ele = 0
    for i in range(M):
        sequence[0] = i
        now_seq = copy.copy(sequence)
        seq_deque.append([now_ele, now_seq])

    while len(seq_deque) > 0:
        pre_ele ,pre_seq = seq_deque.popleft()
        if pre_seq[-1] != -1:
            seq_list.append(pre_seq)
            continue

        end_ele = M - sum(pre_seq[0:pre_ele+1])
        for i in range(end_ele):
            pre_seq[pre_ele+1] = i
            now_seq = copy.copy(pre_seq)
            seq_deque.append([pre_ele+1 ,now_seq])

    for i_seq in seq_list:
        now_value = 1
        for i, i_value in enumerate(i_seq):
            now_value += i_value
            i_seq[i] = now_value

    return seq_list


if __name__ == '__main__':
    main()
    sys.exit(0)

Solution (Python):
import sys
import os
import math
import bisect
import collections
import itertools

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def f(A, B, x):
    return math.floor(A * x / B) - A * math.floor(x / B)


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N, M, Q = il()
    abcd = [il() for _ in range(Q)]

    ret = 0
    for i in itertools.combinations_with_replacement(range(1, M + 1), N):
        tmp = 0
        for a, b, c, d in abcd:
            if i[b - 1] - i[a - 1] == c: tmp += d

        ret = max(ret, tmp)

    print(ret)


if __name__ == '__main__':
    main()

Solution (Python):
import itertools

n, m, q = map(int, input().split())
abcd = [tuple(map(int, input().split())) for _ in range(q)]
ans = 0
for com in itertools.combinations_with_replacement(range(1, m + 1), n):
    score = sum([d for a, b, c, d in abcd if com[b-1] - com[a-1] == c])
    if ans < score:
        ans = score
print(ans)

Solution (Python):
N, M, Q = map(int, input().split())
ABCD = [tuple(map(int, input().split())) for _ in range(Q)]
ans, A = 0, [1] * (N - 1) + [0]
while A != [M] * N:
    if A[N - 1] < M:
        A[N - 1] += 1
    else:
        c = N - 2
        while A[c] == M:
            c -= 1
        A[c] += 1
        for i in range(c + 1, N):
            A[i] = A[c]
    ans = max(ans, sum([d for a, b, c, d in ABCD if A[b - 1] - A[a - 1] == c]))
print(ans)

Solution (Python):
import itertools
 
n, m, q = map(int, input().split())
abcd = [list(map(int, input(). split())) for _ in range(q)]
 
points = []
for able in itertools.combinations_with_replacement(range(1, m+1), n):
    point = 0
    for a, b, c, d in abcd:
        if able[b-1] - able[a-1] == c:
            point += d
    points.append(point)
 
print(max(points))

Solution (Python):
def Array_list(array_list,m,n):
    if n == 0:
        return array_list
    else:
        array_list_next = []
        for array in array_list:
            for i in range(array[len(array)-1],m+1):
                array_list_next.append(array+[i])
        return Array_list(array_list_next,m,n-1)

def main():
    N,M,Q = map(int,input().split())
    abcd = [list(map(int,input().split())) for _ in range(Q)]

    L = [[i] for i in range(1,M+1)]
    array_list = Array_list(L,M,N)

    ans,tmp = 0,0
    for array in array_list:
        tmp = 0
        for a,b,c,d in abcd:
            if array[b-1] - array[a-1] == c:
                tmp += d
        ans = max(tmp,ans)

    print(ans)

if __name__ == "__main__":
    main()

Solution (Python):
import sys
import itertools
import numpy as np


read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M, Q = map(int, readline().split())
A = np.array(list(itertools.combinations_with_replacement(range(1, M + 1), N)))
n = len(A)
score = np.zeros(n, np.int32)
m = map(int, read().split())
for a, b, c, d in zip(m, m, m, m):
    cond = A[:, b - 1] - A[:, a - 1] == c
    score += d * cond
print(score.max())

Solution (Python):
import itertools
n,m,q=map(int,input().split())
a=[0 for i in range(q)]
b=[0 for i in range(q)]
c=[0 for i in range(q)]
d=[0 for i in range(q)]
for i in range(q):
    a[i],b[i],c[i],d[i]=map(int,input().split())
    b[i]-=1;a[i]-=1
ans=0
for seq in itertools.combinations_with_replacement(range(m),n):
    tmp = 0
    for i in range(q):
        if seq[b[i]]-seq[a[i]]==c[i]:
            tmp+=d[i]
    ans=max(ans,tmp)
print(ans)

Solution (Python):
import itertools
N,M,Q = map(int,input().split())
L = [list(map(int,input().split())) for _ in range(Q)]
data = list(range(1,M+1))
A=list(itertools.combinations_with_replacement(data,N))
max_score = 0

for Ai in A:
  x = 0
  for a,b,c,d in L:
    if Ai[b-1] - Ai[a-1] == c:
      x += d
  max_score = max(max_score,x)

print(max_score)

Solution (Python):

import sys
import functools
sys.setrecursionlimit(10**8)
INF = float("inf")


def solve(N: int, M: int, Q: int,
          a: "List[int]", b: "List[int]", c: "List[int]", d: "List[int]"):

    
    @functools.lru_cache(maxsize=None)
    def f(n, m):
        if n == 1:
            return m
        ret = 0
        for i in range(m, 0, -1):
            ret += f(n-1, i)
        return ret
    

    samples = []
    

    def rec(curr, lower, d):
        
        if d < N:
            for i in range(lower, M+1):
                rec(curr+[i], i, d+1)
        else:
            for i in range(lower, M+1):
                samples.append(curr+[i])

    max_tot = -INF
    rec([], 1, 1)

    
    for A in samples:  
        
        tot = 0
        for aa, bb, cc, dd in zip(a, b, c, d):
            if A[bb-1] - A[aa-1] == cc:
                tot += dd
        max_tot = max(tot, max_tot)
    print(max_tot)
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    M = int(next(tokens))  
    Q = int(next(tokens))  
    a = [int()] * (Q)  
    b = [int()] * (Q)  
    c = [int()] * (Q)  
    d = [int()] * (Q)  
    for i in range(Q):
        a[i] = int(next(tokens))
        b[i] = int(next(tokens))
        c[i] = int(next(tokens))
        d[i] = int(next(tokens))
    solve(N, M, Q, a, b, c, d)


if __name__ == '__main__':
    main()

Solution (Python):
f=lambda:map(int,input().split())
n,m,q=f()
Q=[list(f())for _ in range(q)]
from itertools import*
print(max(sum(d for a,b,c,d in Q if l[b-1]-l[a-1]==c)for l in combinations_with_replacement(range(m),n)))

Solution (Python):
import sys
sys.setrecursionlimit(10**7) 
N,M,Q = map(int, input().split())
a = [0]*Q
b = [0]*Q
c = [0]*Q
d = [0]*Q
for i in range(Q):
    a[i],b[i],c[i],d[i] = map(int, input().split())

ans = 0
def dfs(L):
    global ans
    if len(L) == N+1:
        sumnum = 0
        for i in range(Q):
            if L[b[i]] - L[a[i]]==c[i]:
                sumnum += d[i]
        ans = max(ans, sumnum)
        return 0
    A = L.copy()
    A.append(A[-1])
    while A[-1] <= M:
        dfs(A)
        A[-1]+=1

dfs([1])
print(ans)

Solution (Python):
import itertools

def score(a, abcd):
    ans = 0
    for i in abcd:
        if a[i[1] -1] - a[i[0] -1] == i[2]:
            ans += i[3]
    
    return ans

N ,M, Q = map(int, input().split())
abcd = list()
for i in range(Q):
    abcd.append(list(map(int, input().split())))

ans = 0
for a in itertools.combinations_with_replacement(range(1, M+1), N):
    ans = max(ans, score(a, abcd))

print(ans)

Solution (Python):
def recursion(n,m,curList,res):
    if len(curList) == n:
        res.append(curList.copy())
        return

    for i in range(1,m+1):
        if len(curList) > 0 and i < curList[-1]:
            continue
        curList.append(i)
        recursion(n,m,curList,res)
        curList.remove(curList[-1])

def makeSequenceList(n,m):
    res = []
    recursion(n,m,[],res)
    return res

n,m,q = map(int,input().split())
quadList = []
for i in range(q):
    quad = [int(ch) for ch in input().split()]
    quadList.append(quad)
seqList = makeSequenceList(n,m)
ans = -1
for seq in seqList:
    sum = 0
    for quad in quadList:
        if seq[quad[1]-1] - seq[quad[0]-1] == quad[2]:
            sum += quad[3]
    ans = max(sum,ans)
print(ans)

Solution (Python):
n, m, q = list(map(int, input().split()))
a, b, c, d = [0] * q, [0] * q, [0] * q, [0] * q
for i in range(q):
    a[i], b[i], c[i], d[i] = map(int, input().split())

A = [0] * (n+1)
A[0] = 1
ans = 0
def dfs(k):
    global ans
    if k == n+1:
        now = 0
        for i in range(q):
            if A[b[i]] - A[a[i]] == c[i]:
                now += d[i]
        ans = max(ans, now)
    else:
        for i in range(A[k-1], m+1):
            A[k] = i
            dfs(k+1)

dfs(1)
print(ans)

Solution (Python):
import itertools

n,m,q=map(int,input().split())

a=[]
b=[]
c=[]
d=[]

for i in range(q):
    A,B,C,D=map(int,input().split())
    a.append(A)
    b.append(B)
    c.append(C)
    d.append(D)

p=list(range(1,m+1))
ans=0
cnt=0

for i in itertools.combinations_with_replacement(p, n):
    ans=max(ans,cnt)
    cnt=0
    for j in range(q):
        if i[b[j]-1] - i[a[j]-1]==c[j]:
            cnt+=d[j]

print(max(cnt,ans))

Solution (Python):
def c_many_requirements_dfs():
    import sys
    sys.setrecursionlimit(10**6)
    N, M, Q = [int(i) for i in input().split()]
    Queries = [[int(i) for i in input().split()] for j in range(Q)]

    def calc_score(seq):
        return sum(d for a, b, c, d in Queries if seq[b - 1] - seq[a - 1] == c)

    def dfs(seq):
        if len(seq) == N:
            return calc_score(seq)

        ret = 0
        left = seq[-1] if seq else 1
        for i in range(left, M + 1):
            ret = max(ret, dfs(seq + [i]))
        return ret
    return dfs([])

print(c_many_requirements_dfs())

Solution (Python):
def c_many_requirements():
    from itertools import combinations_with_replacement as h
    N, M, Q = [int(i) for i in input().split()]
    Queries = [[int(i) for i in input().split()] for j in range(Q)]

    def calc_score(seq):
        return sum(d for a, b, c, d in Queries if seq[b - 1] - seq[a - 1] == c)
    return max([calc_score(sequence) for sequence in h(range(1, M + 1), N)])

print(c_many_requirements())

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

ans = 0
def main():
    N, M, Q = map(int, readline().split())
    query = []
    for _ in range(Q):
        a, b, c, d = map(int, readline().split())
        query.append((a, b, c, d))

    def getScore(array):
        res = 0
        for a, b, c, d in query:
            if array[b-1]-array[a-1] == c:
                res += d
        return res

    A = [0]*N

    def dfs(idx):
        global ans
        if idx == N:
            ans = max(getScore(A), ans)
        else:
            if idx == 0:
                k = 1
            else:
                k = A[idx-1]
            for i in range(k, M+1):
                A[idx] = i
                dfs(idx+1)

    dfs(0)
    print(ans)
if __name__ == '__main__':
    main()

Solution (Python):
n,m,q=map(int,input().split())
li=[list(map(int,input().split()))for _ in range(q)]

ans = 0
def dfs(A):
    
    global ans 
    if len(A) == n+1:
        tmp = 0
        for a,b,c,d in li:
            if A[b] - A[a] == c:
                tmp += d
            ans = max(ans,tmp)
        return
    for i in range(A[len(A)-1],m+1):
        dfs(A+[i])
dfs([1])
print(ans)

Solution (Python):
import itertools

n, m, q = map(int, input().split())
a = [0 for i in range(q)]
b = [0 for i in range(q)]
c = [0 for i in range(q)]
d = [0 for i in range(q)]

for i in range(q):
    a[i], b[i], c[i], d[i] = map(int, input().split())

score = 0
for SR in itertools.combinations_with_replacement(range(1, m+1), n):
    now = 0
    for i in range(q):
        now += d[i] if SR[b[i]-1] - SR[a[i]-1] == c[i] else 0
    score = max(score, now)

print(score)

Solution (Python):
N, M, Q = map(int, input().split())
q_list = list()
for _ in range(Q):
     q_list.append( tuple( map(int, input().split()) ) )

from itertools import combinations_with_replacement
A_conbi = combinations_with_replacement(range(1,M+1), N)

max_v = 0
for A in A_conbi:
    sum_v = 0
    for a,b,c,d in q_list:
        if A[b-1]-A[a-1] == c:
            sum_v = sum_v + d
    max_v = max(max_v, sum_v)

print(max_v)