#include<bits/stdc++.h>
#define int long long
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define puts(x) cout << (x) << "\n"
using namespace std;
set<int>s; map<int, int>m; int n, CK, a[234567], b[234567], c[234567], dp[456789];
signed main() {
	cin >> n >> CK;
	for1(i, n) {
		cin >> a[i] >> b[i] >> c[i];
		s.insert(a[i]);
		s.insert(++b[i]);
	}
	auto itr = s.begin();
	for1(i, s.size()) m[*itr++] = i;
	for1(i, n) { dp[m[a[i]]] += c[i]; dp[m[b[i]]] -= c[i]; }
	itr = s.begin();
	for1(i, s.size()) {
		dp[i] += dp[i - 1]; dp[456543] -= min(dp[i], CK) * (*itr); dp[456543] += min(dp[i], CK) * (*++itr);
	}
	puts(dp[456543]);
}
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
typedef vector<int> vi;
typedef vector<ll> vll;
 
typedef vector<vi> vvi;
typedef vector<vll> vvll;
 
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
typedef vector<pii> vpii;
typedef vector<pll> vpll;
 
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
 
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define fi first
#define se second
 
template<class T> bool ckmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<class T> bool ckmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}
 
namespace debug {
    void __print(int x) {cerr << x;}
    void __print(long long x) {cerr << x;}
    void __print(double x) {cerr << x;}
    void __print(long double x) {cerr << x;}
    void __print(char x) {cerr << '\'' << x << '\'';}
    void __print(const string &x) {cerr << '\"' << x << '\"';}
    void __print(bool x) {cerr << (x ? "true" : "false");}
 
    template<typename T, typename V>
    void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
    template<typename T>
    void __print(const T &x) {int f = 0; cerr << '{'; for(auto z : x) cerr << (f++ ? "," : ""), __print(z); cerr << "}";}
    void _print() {cerr << "]\n";}
    template <typename T, typename... V>
    void _print(T t, V... v) {__print(t); if(sizeof...(v)) cerr << ", "; _print(v...);}
 
#ifdef ljuba
#define dbg(x...) cerr << "LINE(" << __LINE__ << ") -> " << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif
}
 
using namespace debug;
 
const char nl = '\n';
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
vpii doga[30];
bool ok[1<<21];
ll dp[1<<21];
 
void solve() {
    int n, m;
    cin >> n >> m;
    for(int i = 0; i < m; ++i) {
        int x, y, z;
        cin >> x >> y >> z;
        doga[x].pb({y, z});
    }
 
    ok[0] = 1;
 
    for(int mask = 1; mask < (1<<n); ++mask) {
        int k = __builtin_popcount(mask);
        ok[mask] = 1;
        for(auto z : doga[k]) {
            int cnt = 0;
            for(int i = 0; i < z.fi; ++i) {
                cnt += (mask>>i)&1;
            }
            if(cnt > z.se) ok[mask] = 0;
        }
    }
 
    dp[0] = 1;
 
    for(int mask = 1; mask < (1<<n); ++mask) {
        if(!ok[mask]) {
            dp[mask] = 0;
            continue;
        }
 
        for(int i = 0; i < n; ++i) {
            if((mask>>i)&1) {
                dp[mask] += dp[mask^(1<<i)];
            }
        }
    }
 
    cout << dp[(1<<n)-1] << nl;
}
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
#ifdef ljuba
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    freopen("error.txt", "w", stderr);
#endif
 
    int testCases = 1;
//    cin >> testCases;
    while(testCases--)
        solve();
 
}