#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsigned int
#define ull unsigned long long 
#define bs bitset < N >
using namespace std;
const int N = 2e4 + 7, mod = 998244353;
int n, m;
vi G[N];
vi ve[N];
int vis[N];
int dak[N][4];

unordered_map < ll, int > MP; 

inline ll getid(int x, int y) {
	if(x > y) swap(x, y);
	return (ll) x * n + y;
}

bitset < N > S[N], le[N / 2], re[N / 2]; 

int w2[N], w3[N], me[N];
int eu[N], ev[N];
int ans = 0;
inline void cyc(int x, int y, int z, int exy, int eyz, int ezx) {
	(ans += dak[x][3]) %= mod;
	(ans += mod - w3[ezx]) %= mod;
	(ans += mod - w3[exy]) %= mod;
	(ans += mod - me[x]) %= mod;
//	cout<<"ans="<<dak[x][3]<<' '<<w3[ezx]<<' '<<w3[exy]<<' '<<me[x]<<endl;
	
	(ans += mod - (ll) (w2[exy] - 1) * (dak[y][1] - 2) % mod) %= mod;
	(ans += mod - (ll) (w2[ezx] - 1) * (dak[z][1] - 2) % mod) %= mod;
	(ans += mod - (ll) (dak[x][1] - 2) * (dak[x][1] - 2) % mod) %= mod;
//	cout<<"ans="<<ans<<endl; 
	
	(ans += mod - dak[y][2]) %= mod;
	(ans += mod - dak[z][2]) %= mod;
	
	(ans += w2[eyz] + w2[exy] + 2) %= mod;
	(ans += w2[ezx] + w2[eyz] + 2) %= mod;
	
//	cout << x << ' ' << y << ' ' << z << " : " << (ans + mod - preans) % mod << endl;
}

int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> m;
	L(i, 1, m) {
		int u, v;
		cin >> u >> v;
		++u, ++v;
		eu[i] = u;
		ev[i] = v;
		G[u].emplace_back(v);
		G[v].emplace_back(u);
		S[u].set(i * 2 - 1), S[u + n].set(i * 2);
		S[v].set(i * 2), S[v + n].set(i * 2 - 1);
	}
	L(i, 1, m) {
		int u = eu[i], v = ev[i];
		MP[getid(u, v)] = i;
		le[u] |= S[v], le[v] |= S[u];
		re[u] |= S[v + n], re[v] |= S[u + n];
	}
	
	L(i, 1, n) {
		me[i] = (le[i] & re[i]).count();
	}
	L(i, 1, m) {
		int u = eu[i], v = ev[i];
		w3[i] = (le[u] & re[v]).count();
//		cout << u << ' ' << v << " : " << w3[i] << endl;
		if(sz(G[u]) > sz(G[v])) swap(u, v);
		else if(sz(G[u]) == sz(G[v]) && u > v) swap(u, v);
		ve[u].push_back(v);
	}
	L(i, 1, n) {
		dak[i][0] = 1;
	}
	L(d, 1, 3) {
		L(u, 1, n) {
			for(auto v : G[u]) {
				(dak[v][d] += dak[u][d - 1]) %= mod;
			}
		}
	}
	
	L(i, 1, n) {
		for(int j : ve[i]) vis[j] = 1;
		for(int j : ve[i]) for(int k : ve[j]) if(vis[k]) {
			int ij = MP[getid(i, j)];
			int jk = MP[getid(j, k)];
			int ki = MP[getid(k, i)];
			w2[ij] += 1;
			w2[jk] += 1;
			w2[ki] += 1;
		}
		for(int j : ve[i]) vis[j] = 0;
	}
	
	L(i, 1, n) {
		for(int j : ve[i]) vis[j] = 1;
		for(int j : ve[i]) for(int k : ve[j]) if(vis[k]) {
			int ij = MP[getid(i, j)];
			int jk = MP[getid(j, k)];
			int ki = MP[getid(k, i)];
			
			cyc(i, j, k, ij, jk, ki);
			cyc(j, k, i, jk, ki, ij);
			cyc(k, i, j, ki, ij, jk);
		}
		for(int j : ve[i]) vis[j] = 0;
	}
	
	cout << ans << '\n';
	return 0;
}