# include <bits/stdc++.h>
# define pii pair<int, int> 
# define pii64 pair<i64, i64> 
# define mp make_pair
using namespace std; 
using i64 = long long; 
const i64 mod = 998244353; 
void Add(i64 &x, i64 y) { x = (x + y) % mod; if(x < 0) x += mod; return; } 
void Mul(i64 &x, i64 y) { x = x * y % mod; return; }
const int N = 2e5 + 5; 
int n, m; 
map <int, pii64> g[N]; // first 联通 second 不连通

i64 prod = 1ll; 
bool del[N]; 
void Build(void)
{
    queue <int> Q; 
    for(int i = 1; i <= n; i++) 
    {
        if((int)g[i].size() <= 2) Q.push(i); 
    }
    while(!Q.empty())
    {
        int x = Q.front(); Q.pop(); 
        if(del[x]) continue; del[x] = 1; 
        // printf("build : x = %d, deg = %d\n", x, (int)g[x].size()); 
        if((int)g[x].size() == 1) 
        {
            int v = g[x].begin() -> first; 
            Mul(prod, g[x].begin() -> second.first); 
            g[v].erase(x); 
            g[x].clear(); 
            if(!del[v] && (int)g[v].size() <= 2) Q.push(v); 
        }
        else if((int)g[x].size() == 2)
        {
            auto [y, z] = mp(g[x].begin() -> first, g[x].rbegin() -> first); 
            auto [f1, g1] = g[x].begin() -> second; 
            auto [f2, g2] = g[x].rbegin() -> second; 
            i64 nf = f1 * f2 % mod, ng = ((f1 * g2 % mod) + (f2 * g1 % mod)) % mod; 
            if(g[y].find(z) == g[y].end()) // 没有 (y,z) 这条边
            {
                g[y][z] = g[z][y] = {nf, ng}; 
            }           
            else
            {
                auto [fp, gp] = g[y][z]; 
                g[y][z] = g[z][y] = {((nf * gp % mod) + (ng * fp % mod)) % mod, ng * gp % mod}; 
            }
            g[y].erase(x), g[z].erase(x); 
            g[x].clear(); 
            if(!del[y] && (int)g[y].size() <= 2) Q.push(y); 
            if(!del[z] && (int)g[z].size() <= 2) Q.push(z); 
        }
    }
    return; 
}

int main(void)
{
    scanf("%d%d", &n, &m); 
    for(int i = 1; i <= m; i++)
    {
        int u, v; scanf("%d%d", &u, &v); 
        if(g[u].find(v) == g[u].end()) g[u][v] = g[v][u] = {1, 1};
        else g[u][v].first++, g[v][u].first++; 
    }

    Build(); 
    printf("%lld\n", prod); 
    return 0; 
}