#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
using ld = double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
template<typename T>
void chmin(T& a, T b) {
a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
vector<T> res;
int ida = 0, idb = 0;
while (ida < a.size() || idb < b.size()) {
if (idb == b.size()) {
res.push_back(a[ida]); ida++;
}
else if (ida == a.size()) {
res.push_back(b[idb]); idb++;
}
else {
if (a[ida] < b[idb]) {
res.push_back(a[ida]); ida++;
}
else {
res.push_back(b[idb]); idb++;
}
}
}
return res;
}
template<typename T>
void cinarray(vector<T>& v) {
rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
rep(i, v.size()) {
if (i > 0)cout << " "; cout << v[i];
}
cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
if (n < 0) {
ll res = mod_pow(x, -n, m);
return mod_pow(res, m - 2, m);
}
if (abs(x) >= m)x %= m;
if (x < 0)x += m;
//if (x == 0)return 0;
ll res = 1;
while (n) {
if (n & 1)res = res * x % m;
x = x * x % m; n >>= 1;
}
return res;
}
//mod should be <2^31
struct modint {
int n;
modint() :n(0) { ; }
modint(ll m) {
if (m < 0 || mod <= m) {
m %= mod; if (m < 0)m += mod;
}
n = m;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
if (n == 0)return modint(1);
modint res = (a * a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[a - b];
}
ll gcd(ll a, ll b) {
a = abs(a); b = abs(b);
if (a < b)swap(a, b);
while (b) {
ll r = a % b; a = b; b = r;
}
return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
if (loc >= v.size())v.resize(loc + 1, 0);
v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
fill(isp + 2, isp + mn, true);
for (int i = 2; i < mn; i++) {
if (!isp[i])continue;
ps.push_back(i);
for (int j = 2 * i; j < mn; j += i) {
isp[j] = false;
}
}
}*/
//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
auto res = st.lower_bound(val);
if (res == st.begin())return st.end();
res--; return res;
}
//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
auto res = st.lower_bound(val);
return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
a = a + b; return a;
}
mP operator-(mP a, mP b) {
return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
a = a - b; return a;
}
LP operator+(LP a, LP b) {
return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
a = a + b; return a;
}
LP operator-(LP a, LP b) {
return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
a = a - b; return a;
}
mt19937 mt(time(0));
const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };
//------------------------------------
struct uf {
private:
vector<int> par, ran;
public:
uf(int n) {
par.resize(n, 0);
ran.resize(n, 0);
rep(i, n) {
par[i] = i;
}
}
int find(int x) {
if (par[x] == x)return x;
else return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)return;
if (ran[x] < ran[y]) {
par[x] = y;
}
else {
par[y] = x;
if (ran[x] == ran[y])ran[x]++;
}
}
bool same(int x, int y) {
return find(x) == find(y);
}
};
modint sol(int n, vector<P> ps) {
/* vector<vector<bool>> exi(n, vector<bool>(n));
for (auto p : ps) {
exi[p.first][p.second] = exi[p.second][p.first] = true;
}*/
int res = 0;
rep(i, (1 << n)) {
/*vector<int> ids;
rep(j, n)if (i & (1 << j))ids.push_back(j);*/
int c = 1;
for (auto p : ps) {
if (i & (1 << p.first))if (i & (1 << p.second)) {
c *= -1;
}
}
res += c;
}
//cout << res << "\n";
//assert(abs(res) == 0 || abs(res) == (1 << ((n + 1) / 2)));
return res;
}
int sol2(int n, vector<P> ps) {
uniform_int_distribution<> ud(0, mod - 1);
vector<vector<modint>> A(n, vector<modint>(n));
for (auto p : ps) {
int v = ud(mt);
A[p.first][p.second] += v;
A[p.second][p.first] -= v;
}
modint res = 1;
int le = 0;
rep(j, n) {
Rep(i, le, n) {
if (A[i][j] == (modint)0)continue;
swap(A[i], A[le]);
//if ((i + j) % 2)res *= -1;
break;
}
if (A[le][j] == (modint)0) {
res = 0;
continue;
break;
}
//res *= A[j][j];
modint coef = (modint)1 / A[le][j];
Rep(i, j + 1, n) {
for (int k = n - 1; k >= j; k--) {
A[i][k] -= A[le][k] * coef * A[i][j];
}
}
le++;
}
le = n - le / 2;
return le;
return res;
}
void exprpr(int n, int m) {
vector<P> ps;
rep(i, n)Rep(j, i + 1, n)ps.push_back({ i,j });
vector<int> v(ps.size());
rep(i, m)v[i] = 1; sort(all(v));
do {
uf u(n);
vector<P> curps;
rep(i, ps.size()) {
if (v[i]) {
curps.push_back(ps[i]);
u.unite(ps[i].first, ps[i].second);
}
}
bool valid = true;
rep(i, n)if (!u.same(0, i))valid = false;
if (valid) {
for (auto p : curps) {
//cout << p.first << " " << p.second << "\n";
}
cout << sol(n,curps)<<" "<<sol2(n, curps) << "\n";
}
} while (next_permutation(all(v)));
}
void expr() {
//exprpr(5, 5);
//return;
for (int n = 1; n <= 5; n++) {
for (int m = 0; m <= n * (n - 1) / 2; m++) {
cout << "hello " << n << " " << m << "\n";
exprpr(n, m);
}
}
// cout << sol(5, { {0,1},{0,2},{0,3},{0,4} }) << "\n";
return;
init_f();
for (int n = 1; n <= 50; n++) {
modint sum = 0;
rep(i, n + 1) {
modint val = comb(n, i);
if (i % 4 >= 2)val *= -1;
sum += val;
}
cout << n << " " << sum << "\n";
}
modint s0 = 1, s1 = 1;
for (int n = 2; n <= 50; n++) {
modint ns0 = s0 + s1;
modint ns1 = s0 - s1;
s0 = ns0;
s1 = ns1;
cout << n << " " << s0 <<" "<<s1<< "\n";
}
}
void solve(){
int n, m; cin >> n >> m;
vector<vector<int>> G(n);
rep(i, m) {
int a, b; cin >> a >> b; a--; b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<bool> used(n);
rep(i, n) {
if (used[i])continue;
int ce = 0;
int cv = 0;
queue<int> que;
que.push(i); used[i] = true;
while (!que.empty()) {
}
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed<<setprecision(12);
//init_f();
//init();
//init2();
//while(true)
/* for (ll i = 0; i < mod; i++)if (i * i % mod == mod - 1) {
cout << i << "\n";
exit(0);
}*/
expr();
//int t; cin >> t; rep(i, t)
solve();
return 0;
}
impossible