// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T& x, T y) { x = max(x, y); }
template <typename T> inline void chkmin(T& x, T y) { x = min(x, y); }
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 1010, MOD = 998244353, inv2 = (MOD + 1) >> 1;
int n, m, ans = 1, t = 1;
bitset <N> a[N];
signed main() {
	read(n), read(m);
	F(i, 1, n) t = 2 * t % MOD;
	F(i, 1, m) {
		int x, y; read(x), read(y);
		a[x][y] = a[y][x] = true;
	}
	DF(i, n, 1) {
		// F(x, 1, i) {
		// 	F(y, 1, i)
		// 		cout << a[x][y];
		// 	cout << endl;
		// }
		// cout << endl;
		bool flag = false;
		F(j, 1, i - 1) flag |= a[i][j];
		if (flag) {
			int pos;
			F(j, 1, i - 1)
				if (a[j][i]) {
					pos = j;
					break;
				}
			// F(j, 1, i - 1)
			// 	if (a[i][i] && a[i][j] && j != pos) a[j][j].flip();
			// F(x, 1, i) {
			// 	F(y, 1, i)
			// 		cout << a[x][y];
			// 	cout << endl;
			// }
			// cout << endl;
			// debug << pos << endl;
			a[i][pos] = false;
			F(j, 1, i - 1) if (j != pos && a[pos][j]) {
				a[j] ^= a[i];
				if (a[i][i] ^ a[i][j]) a[j][j].flip();
			}
			F(j, 1, i - 1) if (j != pos && a[i][j]) {
				a[j] ^= a[pos];
			}
			if (a[pos][pos]) {
				F(j, 1, n)
					if (j != i && j != pos && a[i][j]) a[j][j].flip();
				if (a[i][i]) ans = (ll) ans * (MOD - 1) % MOD;//, debug << "FUCK\n";
			}
			// F(x, 1, i) {
			// 	F(y, 1, i)
			// 		cout << a[x][y];
			// 	cout << endl;
			// }
			// cout << pos << endl;
			// debug << i << " " << pos << endl;
			F(j, 1, i - 2) {
				if (j >= pos) a[j] = a[j + 1];
				bitset <N> s = (a[j] >> pos) << pos;
				// F(k, 1, i - 1) cout << a[j][k]; cout << endl;
				a[j] = a[j] ^ s ^ (s >> 1);
				// F(k, 1, i - 2) cout << a[j][k]; cout << endl;
			}
			i--;
			ans = (ll) ans * 2 % MOD;
			// debug << i << endl;
		} else if (!a[i][i]) ans = (ll) ans * 2 % MOD;//, debug << i << endl;
			else ans = 0;
	}
	// debug << ans << endl;
	cout << (ll) (t + ans) * inv2 % MOD;
	return 0;
}
/* why?
4 6
1 2
1 3
1 4
2 3
2 4
3 4
*/