E. Mocha and Stars（莫比乌斯反演+简单dp）

code：

#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int mod = 998244353, N = 1e5 + 10,maxn=105;

int l[maxn], r[maxn], n, m;
ll sum[maxn][N];


const int MAXN = 1e6+5;
bool vis[MAXN + 10];
int prime[MAXN + 10], mu[MAXN + 10];
void Mu() {
    memset(vis, false, sizeof vis);
    mu[1] = 1;
    int tot = 0;
    for (int i = 2; i <= MAXN; i++) {
        if (!vis[i]) {
            prime[tot++] = i;
            mu[i] = -1;
        }
        for (int j = 0; j < tot; j++) {
            if (i * prime[j] > MAXN) break;
            vis[i * prime[j]] = true;
            if (i % prime[j] == 0) {
                mu[i * prime[j]] = 0;
                break;
            } else {
                mu[i * prime[j]] = -mu[i];
            }
        }
    }
}


ll solve(int d) {
    int tm = m / d;
    sum[0][0] = 1;
    for (int j = 1; j <= tm; j++) {
        sum[0][j] = 1;
    }
    for (int i = 1; i <= n; i++) {
        int tl = l[i]/d+(l[i]%d!=0), tr = r[i] / d;
        sum[i][0] = 0;
        for (int j = 1; j <= tm; j++) {
            sum[i][j] = sum[i][j - 1];  
            if (j - tl >= 0) {
                sum[i][j] = (sum[i][j] + sum[i - 1][j - tl]) % mod;
            }
            if (j - tr - 1 >= 0) {
                sum[i][j] = (sum[i][j] - sum[i - 1][j - tr - 1] + mod) % mod;
            }
        }
    }
    return sum[n][tm];
}

int main() {
    Mu();
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> l[i] >> r[i];
    }
    ll res = 0;
    for (int i = 1; i <= m; i++) {
        res = (res + (1LL * mu[i] * solve(i) % mod) + mod) % mod;
    }
    cout << res <<endl;
    return 0;
}