#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a,bool upp=0){if(a) cout<<(upp?"YES\n":"Yes\n"); else cout<<(upp?"NO\n":"No\n");}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}


void solve();
// oddloop
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t=1;
    //cin>>t;
    rep(i,0,t) solve();
}

void solve(){
    int N,M;
    cin>>N>>M;
    vector<vector<int>> G(N);
    rep(i,0,M){
        int a,b;
        cin>>a>>b;
        a--,b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    vector<ll> dp(N,1);
    /*
    rep(i,0,N){
        vector<int> seen(N),order={i};
        seen[i]=1;
        dp[i]%=mod;
        rep(j,0,order.size()){
            int a=order[j];
            for(auto x:G[a]){
                if(seen[x]==0){
                    seen[x]=1;
                    if(x<i) order.push_back(x);
                    else dp[x]+=dp[i];
                }
            }
        }
    }*/
    ll ans=0;
    vector<int> par(N);
    vector<set<int>> s(N);
    rep(i,0,N) par[i]=i;
    int ind=0;
    ll val=0;
    auto root=[&](auto self,int var) -> int {
        if(var==par[var]) return var;
        par[var]=self(self,par[var]);
        return par[var];
    };
    auto unite=[&](int a,int b) -> void {
        a=root(root,a);
        b=root(root,b);
        if(s[a].size()<s[b].size()) swap(a,b);
        for(auto x:s[b]){
            if(s[a].count(x)){
                dp[x]=(dp[x]+dp[b]-val)%mod;
            }
            else{
                dp[x]=(dp[x]+dp[b]-dp[a])%mod;
                s[a].insert(x);
            }
        }
        par[b]=a;
    };
    do{
        set<int> tmp;
        for(auto x:G[ind]){
            if(x<ind) tmp.insert(root(root,x));
        }
        for(auto x:tmp) dp[ind]=(dp[ind]+dp[x])%mod;
        ans=(ans+dp[ind])%mod;
        val=dp[ind];
        for(auto x:G[ind]){
            if(x>ind) s[ind].insert(x);
        }
        for(auto x:tmp) dp[x]=(dp[x]+dp[ind])%mod;
        for(auto x:tmp){
            s[x].erase(ind);
            unite(ind,x);
        }
    }while(ind++,ind<N);
    cout<<(ans+mod)%mod<<"\n";
}