#include <bits/stdc++.h>

typedef long double ld;
typedef long long ll;
using namespace std;
int di[] = {1, 0, -1, -1, 0, 1, -1, 1};
int dj[] = {1, 1, 0, -1, -1, 0, 1, -1};
const ll oo = 1e18, MOD = 998244353;
const int N = 2005, M = 350;
const ld PI = acos(-1.0), EPS = 1e-9;

int n, m, p, c[N], vis[N];
vector<int> v[N];
bool no;

void dfs(int node) {
    vis[node] = 1;
    for (auto x:v[node]) {
        if (!vis[x]) c[x] = !c[node], dfs(x);
        else if (c[x] == c[node]) no = 1;
    }
}

//#define endl '\n'
int main() {
    //ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    //freopen("farm.in", "r", stdin);
    //memset(dp, -1, sizeof dp);
    cin >> n >> m >> p;
    while (m--) {
        int x, y;
        cin >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        if (!vis[i]) dfs(i), ans++;
    }
    ll ans2 = 1;
    for (int i = 1; i < ans; i++) ans2 = (ans2 * 2) % p;
    if (no) return !(cout << "impossible");
    else cout << (ans2 + 1 + p) % p;
    return 0;
}