#include <bits/stdc++.h>

using namespace std;
using ll = long long;

struct Segment {
    int t, l, r, w;
};

constexpr ll inf = 3e18;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;

    vector<Segment> s(m);

    for (auto &[t, l, r, w] : s) {
        cin >> t >> l >> r >> w;
    }

    sort(s.begin(), s.end(), [&](const auto &x, const auto &y) {
        return array{x.r + x.t, y.l} < array{y.r + y.t, y.l};
    });

    vector<ll> dp(m);

    for (int i = 0; i < m; ++i) {
        if (s[i].l == 1) {
            dp[i] = s[i].w;
            continue;
        }
        dp[i] = inf;
        for (int j = 0; j < i; ++j) {
            if (s[j].r - s[i].l + 1 >= abs(s[i].t - s[j].t)) {
                dp[i] = min(dp[i], dp[j] + s[i].w);
            }
        }
    }

    ll ans = inf;

    for (int i = 0; i < m; ++i) {
        if (s[i].r == n) {
            ans = min(ans, dp[i]);
        }
    }

    if (ans == inf) {
        cout << "-1\n";
    } else {
        cout << ans << '\n';
    }

    return 0;
}