#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <stack>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

const ll MOD = 998244353;
using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

#define N_MAX 400002
mint inv[N_MAX],fac[N_MAX],finv[N_MAX];

void init(){
    fac[0]=1;fac[1]=1;
    finv[0]=1;finv[1]=1;
    inv[1]=1;
    for(int i=2;i<N_MAX;i++){
        inv[i]=mint(MOD)-inv[MOD%i]*(MOD/i);
        fac[i]=fac[i-1]*(ll) i;
        finv[i]=finv[i-1]*inv[i];
    }
}

mint comb(ll n, ll r){
    if(n < r){
        return mint(0);
    }else{
        return fac[n]*finv[r]*finv[n-r];
    }
}

vector<int> distinct(vector<int> v){
    set<int> st;
    for(int x: v) st.insert(x);
    vector<int> ans;
    for(int x: st) ans.push_back(x);
    return ans;
}

mint catalan(int n){
    return fac[2*n]*finv[n+1]*finv[n];
}

using P = pair<int, int>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    init();
    int n, q; cin >> n >> q;
    vector<ll> v(n);
    for(int i = 0; i < q; i++){
        int l, r; cin >> l >> r; l--; r--;
        for(int x = l; x <= r; x++){
            v[x] += 1l<<i;
        }
    }
    map<ll, int> cnt;
    for(int i = 0; i < n; i++){
        if(cnt.count(v[i])) cnt[v[i]]++;
        else cnt[v[i]] = 1;
    }
    int odd = (n+1)/2, even = n/2;
    mint ans = fac[odd]*fac[even];
    for(auto [x, c]: cnt){
        if(x == 0){
            if(c%2 == 0){
                ans *= catalan(c/2);
            }else{
                ans *= comb(n, even)-comb(n, even-1);
            }
        }else{
            if(c%2 == 1){
                cout << 0 << endl;
                return 0;
            }
            ans *= catalan(c/2);
        }
    }
    cout << ans << endl;
}