#include <bits/stdc++.h>
using namespace std;
using LL = long long;

const int N = 5005, mod = 998244353;

namespace Tarjan {  // 强连通分量
    int n, dfn[N], low[N], tot, id[N], num;
    bool ins[N];
    stack<int> st;
    vector<int> e[N], point[N];

    inline void add(int u, int v) {
        e[u].emplace_back(v);
        e[v].emplace_back(u);
    }

    void init(int n_) {
        n = n_;
        for (int i = 1; i <= n; i++) {
            dfn[i] = 0;
            ins[i] = false;
            e[i].clear();
        }
        for (int i = 1; i <= num; i++) {
            point[i].clear();
        }
        tot = num = 0;
    }

    void tarjan(int p, int fa) {
        low[p] = dfn[p] = ++tot;
        st.push(p);
        ins[p] = true;
        for (int q : e[p]) {
            if (q == fa) {
                continue;
            }
            if (!dfn[q]) {
                tarjan(q, p);
                low[p] = min(low[p], low[q]);
            } else if (ins[q]) {
                low[p] = min(low[p], low[q]);
            }
        }

        if (dfn[p] == low[p]) {
            num++;
            int q = 0;
            while (q != p) {
                q = st.top();
                st.pop();
                ins[q] = false;
                id[q] = num;
                point[num].emplace_back(q);
            }
        }
    }

    void work() {  // tarjan缩点的结果符合拓扑序
        for (int i = 1; i <= n; i++) {
            if (!dfn[i]) {
                tarjan(i, 0);
            }
        }
    }
}  // namespace Tarjan
using Tarjan::id;

inline LL qp(LL x, LL y) {
    LL res = 1;
    while (y) {
        if (y & 1) {
            res = res * x % mod;
        }
        y >>= 1;
        x = x * x % mod;
    }
    return res;
}

inline LL inv(LL x) { return qp(x, mod - 2); }

int n, m, siz[N], cnt[N];
vector<int> e[N];
LL f[N][N], pw[N * N];

inline void add(int u, int v) { e[u].emplace_back(v); }

void dfs(int p, int fa) {
    f[p][siz[p]] = pw[siz[p] * (siz[p] - 1) / 2 - cnt[p]];
    for (int q : e[p]) {
        if (q == fa) {
            continue;
        }
        dfs(q, p);

        LL sum = 0;
        for (int i = 1; i <= siz[q]; i++) {
            sum += f[q][i];
        }
        sum %= mod;
        siz[p] += siz[q];
        for (int i = siz[p]; i >= 0; i--) {
            LL tmp = -sum * f[p][i] % mod;
            for (int j = 1; j <= min(i, siz[q]); j++) {
                tmp = (tmp + f[p][i - j] * f[q][j] % mod * pw[(i - j) * j - 1]) % mod;
            }
            f[p][i] = tmp;
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    pw[0] = 1;
    for (int i = 1; i < N * N; i++) {
        pw[i] = pw[i - 1] * 2 % mod;
    }

    cin >> n >> m;
    Tarjan::init(n);
    for (int i = 1, u, v; i <= m; i++) {
        cin >> u >> v;
        Tarjan::add(u, v);
    }

    Tarjan::work();

    for (int i = 1; i <= n; i++) {
        siz[id[i]]++;
        for (int j : Tarjan::e[i]) {
            if (id[i] != id[j]) {
                add(id[i], id[j]);
            } else if (i < j) {
                cnt[id[i]]++;
            }
        }
    }

    dfs(1, 0);

    LL ans = 0;
    for (int i = 1; i <= n; i++) {
        ans += f[1][i];
    }
    ans = (ans % mod + mod) % mod;
    cout << ans << endl;

    return 0;
}