#pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define ll long long
#define ld long double
#define vi vector<int>
#define vvi vector<vector<int>>
#define vvvi vector<vector<vector<int>>>
#define vs vector<string>
#define vvs vector<vector<string>>
#define vvvs vector<vector<vector<string>>>
#define vd vector<ld>
#define vvd vector<vector<ld>>
#define vvvd vector<vector<vector<ld>>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vvvb vector<vector<vector<bool>>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define vvvp vector<vector<vector<pair<int, int>>>>
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define SORT(a) stable_sort(all(a))
#define RSORT(a) stable_sort(rall(a))
#define rev(a) reverse(all(a))
#define uniq(a) a.erase(unique(all(a)), end(a))
#define lambda(i) [=](auto i)
#define compare(i, j) [=](auto i, auto j)
#define min_of(a) *min_element(all(a))
#define max_of(a) *max_element(all(a))
#define sum(a) accumulate(all(a), 0)
#define count_of(a, i) count(all(a), i)
#define lower(a, i) (lower_bound(all(a), i) - begin(a))  // use member func for set
#define upper(a, i) (upper_bound(all(a), i) - begin(a))
#define binary(a, i) binary_search(all(a), i)
#define exists(a, i) (find(all(a), i) != end(a))
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define sz(a) (int)(a).size()
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i != static_cast<decltype(i)>(-1); i--)
#define rep2(i, a, b) for (auto i = (a); i < (b); i++)
#define rrep2(i, a, b) for (auto i = b - 1; i >= a; i--)
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep2, rep1) \
(__VA_ARGS__)
#define rrep(...) GET_MACRO(__VA_ARGS__, rrep2, rrep1) \
(__VA_ARGS__)
#define each(i, a) for (auto &&i : (a))
using namespace std;

const int INF = 1e18;
const int MOD = 1e9 + 7;
int mod_add(int A, int B) { return (A + B) % MOD; }
int mod_sub(int A, int B) { return (A + MOD - B) % MOD; }
int mod_mul(int A, int B) { return ((A % MOD) * (B % MOD)) % MOD; }
int mod_bipow(int X, int Y) {
    if (Y == 0)
        return 1;
    else if (Y == 1)
        return X % MOD;
    else if (Y % 2 == 0) {
        int Z = mod_bipow(X, (int)(Y / 2));
        return mod_mul(Z, Z);
    } else {
        int Z = mod_bipow(X, (int)(Y / 2));
        return mod_mul(mod_mul(Z, Z), X);
    }
}
int mod_inv(int X) { return mod_bipow(X, MOD - 2); }
int mod_div(int A, int B) { return mod_mul(A, mod_inv(B)); }

template <class T>
bool amin(T &A, T B) {
    if (A > B) {
        A = B;
        return true;
    }
    return false;
}
template <class T>
bool amax(T &A, T B) {
    if (A < B) {
        A = B;
        return true;
    }
    return false;
}
template <class T>
vector<pair<T, int>> indexed_vector(vector<T> V) {
    int N = V.size();
    vector<pair<T, int>> W(N);
    for (int i = 0; i < N; i++) {
        W[i] = make_pair(V[i], i);
    }
    return W;
}

vi divisors(int N) {
    vi ret;
    for (int i = 1; i * i <= N; i++) {
        if (N % i == 0) {
            ret.pb(i);
            if (i * i != N) ret.pb(N / i);
        }
    }
    SORT(ret);
    return ret;
}

map<int, int> prime_factors(int N) {
    map<int, int> ret;
    for (int i = 2; i * i <= N; i++) {
        while (N % i == 0) {
            ret[i]++;
            N /= i;
        }
    }
    if (N != 1) ret[N]++;
    return ret;
}

int ceil_div(int X, int Y) { return (X - 1) / Y + 1; }

vi cum(vi V) {
    vi U(sz(V));
    partial_sum(all(V), begin(U));
    return U;
}

struct union_find {
    vi data;
    union_find(int size) : data(size, -1) {}
    bool union_set(int x, int y) {
        x = root(x);
        y = root(y);
        if (x != y) {
            if (data[y] < data[x]) swap(x, y);
            data[x] += data[y];
            data[y] = x;
        }
        return x != y;
    }
    bool find_set(int x, int y) { return root(x) == root(y); }
    int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
    int size(int x) { return -data[root(x)]; }
};

struct vertex {
    vector<int> adj = vi(0);
};
#pragma endregion header

// MOD = 1e9 + 7;

int ans = 0;
int n, m, q;
vi a, b, c, d;
void dfs(vi v) {
    int SZ = sz(v);
    if (SZ == n) {
        int sum = 0;
        rep(i, q) {
          int x = 0;
          rep(j, a[i] + 1, b[i] + 1)x += v[j];
          if (x == c[i]) sum += d[i];
        }
        ans = max(ans, sum);
    } else {
      int nn = m;
      each(i, v)nn -= i;
        rep(i, nn){
          vi w = vi(SZ + 1);
          rep(i, SZ)w[i] = v[i];
          w[SZ] = i;
          dfs(w);
        }
    }
}

void solve() {
    vi v0 = {};
    dfs(v0);
    cout << ans << endl;
}

#pragma region main
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout << fixed << setprecision(15);

    cin >> n;
    cin >> m;
    cin >> q;
    a=vi(q);
    b=vi(q);
    c=vi(q);
    d=vi(q);
    for (int i = 0; i < q; i++) {
        cin >> a[i];
        cin >> b[i];
        cin >> c[i];
        cin >> d[i];
        a[i]--;
        b[i]--;
    }
    solve();
}
#pragma endregion main


Measured memory_bytes: 3680