#include <bits/stdc++.h>
#define REI register int
#define LL long long
const int INF = INT_MAX;
const int MAXN = 5e5 + 10;
const int mod = 998244353;
using namespace std;
struct Tree
{
    int left, right, delta, sum;
};
Tree tree[4 * MAXN + 100];
struct eee
{
    int l, r, h;
};
eee island[MAXN];
int debris[MAXN], ans;

void Build(int id, int l, int r)
{
    tree[id].left = l;
    tree[id].right = r;
    tree[id].sum = 0;
    if (tree[id].left == tree[id].right)
    {
        tree[id].sum = 1;
        tree[id].delta = 0;
    }
    else
    {
        int mid = (l + r) / 2;
        Build(id * 2, l, mid);
        Build(id * 2 + 1, mid + 1, r);
        tree[id].sum = tree[id * 2].sum + tree[id * 2 + 1].sum;
    }
}
inline int query(int id, int pos)
{
    if (tree[id].left == tree[id].right)
    {
        return tree[id].sum % mod;
    }
    int mid = (tree[id].left + tree[id].right) / 2;
    if (mid > pos)
    {
        return query(id * 2, pos);
    }
    else if (mid < pos)
    {
        return query(id * 2 + 1, pos);
    }
}

inline void update(int id, int l, int r, int val)
{
    if (tree[id].left > r || tree[id].right < l)
        return;
    if (tree[id].left >= l && tree[id].right <= r)
    {
        tree[id].sum = (tree[id].right - tree[id].left + 1) * val;
        tree[id].delta += val;
        return;
    }
    if (tree[id].delta)
    {
        tree[id * 2].sum = (tree[id * 2].right - tree[id * 2].left + 1) * tree[id].delta;
        tree[id * 2].delta = tree[id].delta;
        tree[id * 2 + 1].sum = (tree[id * 2 + 1].right - tree[id * 2 + 1].left + 1) * tree[id].delta;
        tree[id * 2 + 1].delta = tree[id].delta;
        tree[id].delta = 0;
    }
    update(2 * id, l, r, val);
    update(2 * id + 1, l, r, val);
    tree[id].sum = tree[2 * id].sum + tree[id * 2 + 1].sum;
}

bool cmp(eee a, eee b)
{
    return a.h < b.h;
}
int main()
{

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    for (register int i = 1; i <= m; i++)
        cin >> island[i].l >> island[i].r >> island[i].h;
    for (register int i = 1; i <= n; i++)
        cin >> debris[i];
    sort(island + 1, island + 1 + m, cmp);
    Build(1, 1, MAXN);
    for (register int i = 1; i <= m; i++)
    {
        int a, b;
        a = query(1, island[i].l);
        b = query(1, island[i].r);
        update(1, island[i].l, island[i].r, a + b);
        printf("update %d to %d: change to %d\n", island[i].l, island[i].r, a + b);
        for (register int j = 1; j <= 10; j++)
        {
            cout << query(1, j) << " ";
        }
        cout << endl;
    }
    int ans = 0;
    for (register int i = 1; i <= n; i++)
    {
        ans += query(1, debris[i]) % mod;
    }
    cout << ans << endl;

    return 0;
}