/* name: 6555
 * author: 5ab
 * created at: 2023-07-05
 */
#include <iostream>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define ssz(x) (int((x).size()))

using ll = long long;
const int max_n = 1000, mod = 998244353;

int g[max_n][max_n];
bool chk[max_n];

ll qpow(int n)
{
	ll ans = 1, mul = 2;
	while (n)
	{
		if (n & 1)
			ans = ans * mul % mod;
		mul = mul * mul % mod;
		n >>= 1;
	}
	return ans;
}

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int n, m;
	
	cin >> n >> m;
	for (int i = 0, x, y; i < m; i++)
	{
		cin >> x >> y, x--, y--;
		if (x > y) swap(x, y);
		g[x][y] = 1;
	}
	
	int frc = 0, cf = 0;
	for (int i = 0; i < n; i++)
		if (!chk[i])
		{
			int fst = -1;
			for (int j = i + 1; j < n; j++)
				if (g[i][j])
				{
					fst = j;
					break;
				}
			if (fst == -1)
			{
				if (g[i][i] == 1)
				{
					frc = 0;
					break;
				}
				frc++;
				continue;
			}
			frc++;
			chk[fst] = true;
			if (g[i][i])
			{
				cf ^= g[fst][fst];
				for (int j = fst + 1; j < n; j++)
					g[j][j] ^= g[fst][j];
			}
			for (int j = i + 1; j < n; j++)
				if (j < fst ? g[j][fst] : g[fst][j])
					for (int k = fst; k < n; k++)
						(j < k ? g[j][k] : g[k][j]) ^= g[i][k];
		}
	// cerr << frc << endl;
	if (frc == 0)
		cout << qpow(n - 1);
	else if (cf == 0)
		cout << (qpow(n - 1) + qpow(frc - 1)) % mod;
	else
		cout << (qpow(n - 1) - qpow(frc - 1) + mod) % mod;
	cout << endl;
	
	return 0;
}
// started coding at: 07-05 18:33:18