#include <bits/stdc++.h>

using namespace std;

#define int long long 
const int N = 1e6 + 10;
using ll = long long;
int fa[N], sz[N];
int find(int x) {
    return fa[x] == x ? x : fa[x] = find(fa[x]);
}

void merge(int x, int y) {
    int fx = fa[x], fy = fa[y];
    fa[fx] = fy;
    sz[fy] += sz[fx];
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n, m, p;
    cin >> n >> m >> p;
    for (int i = 1; i <= n; i++) {
        fa[i] = i;
        sz[i] = 1;
    }
    std::vector<std::vector<int>> g(n + 1);
    for (int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }


    bool ok = true;
    std::vector<int> col(n + 1, -1);
    function<void(int, int)> dfs = [&](int x, int f) {
        for (auto y : g[x]) {
            if (y == f) continue;
            if (col[y] != -1 && (col[x] == col[y])) {
                ok = false;
            }

            if (col[y] == -1) {
                col[y] = col[x] ^ 1;
                dfs(y, x);
                merge(x, y);
            }
        }
    };

    int res = 1;
    for (int i = 1; i <= n; i++) {
        if (col[i] == -1) {
            col[i] = 0;
            dfs(i, -1);
        }
    }

    std::vector<int> vis(n + 1);
    for (int i = 1; i <= n; i++) {
        if (!vis[find(i)]) {
            res = res * 2 % p;
            vis[find(i)] = 1;
        }
    }
    const int MOD = p;
    auto power = [&](ll a, ll b) {
        ll ans = 1;
        for (; b; b /= 2, a = a * a % MOD) {
            if (b % 2) {
                ans = ans * a % MOD;
            }
        }
        return ans % MOD;
    };
    if (ok) {
        cout << (res * power(2, p - 2) % p + 1) % p;
    } else {
        cout << "impossible";
    }
    
}