#include<bits/stdc++.h>
using namespace std;
const int N=3005,mod=998244353;
inline void add(int &a,int b){a+=b;if(a>=mod)a-=mod;}
int dp[N][N];
int main()
{
	int n,k;
	scanf("%d%d",&n,&k);
	dp[0][0]=1;
	for(int i=1;i<=n;i++)
	{
		for(int j=n;j>=1;j--)
		{
			if(j) add(dp[i][j],dp[i-1][j-1]);
			if(j*2<=n) add(dp[i][j],dp[i][j*2]);
		}
	}
	printf("%d\n",dp[n][k]);
	return 0;
}
#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

int popcount(ll bits) {
    bits = (bits & 0x5555555555555555LL) + (bits >> 1 & 0x5555555555555555LL);
    bits = (bits & 0x3333333333333333LL) + (bits >> 2 & 0x3333333333333333LL);
    bits = (bits & 0x0f0f0f0f0f0f0f0fLL) + (bits >> 4 & 0x0f0f0f0f0f0f0f0fLL);
    bits = (bits & 0x00ff00ff00ff00ffLL) + (bits >> 8 & 0x00ff00ff00ff00ffLL);
    bits = (bits & 0x0000ffff0000ffffLL) + (bits >> 16 & 0x0000ffff0000ffffLL);
    return (bits & 0x00000000ffffffffLL) + (bits >> 32 & 0x00000000ffffffffLL);
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, m;
    input(n, m);
    vector<vector<P>> lm(n);
    rep(i, 0, m) {
        int x, y, z;
        input(x, y, z);
        x--;
        lm[x].emplace_back(y, z);
    }
    int bits = 1 << n;
    vector<ll> dp(bits, 0);
    dp[0] = 1;
    rep(bit, 0, bits) {
        vector<int> cnt(n + 1, 0);
        rep(i, 0, n) {
            if ((bit >> i) & 1) cnt[i + 1]++;
        }
        rep(i, 0, n) {
            cnt[i + 1] += cnt[i];
        }

        rep(i, 0, n) {
            if ((bit >> i) & 1) continue;
            bool ok = true;
            for (auto [y, z] : lm[popcount(bit)]) {
                int c = cnt[y] + (i + 1 <= y);
                if (c > z) {
                    ok = false;
                    break;
                }
            }
            if (ok) {
                dp[bit | 1 << i] += dp[bit];
            }
        }
    }
    print(dp[bits - 1]);
    return 0;
}
