#include <bits/stdc++.h>

#define el '\n'
#define ll long long
#define ld long double

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

int M;
const int N = 1e6 + 5;

int col[N];
vector<int> g[N];

int mul(int a, int b) {
    a = (a % M + M) % M;
    b = (b % M + M) % M;

    return 1LL * a * b % M;
}

int add(int a, int b) {
    a = (a % M + M) % M;
    b = (b % M + M) % M;

    return (a + b) % M;
}

int modPow(int b, int p) {
    if (p == 0)
        return 1;

    int x = modPow(b, p / 2);

    return p % 2 == 0 ? mul(x, x) : mul(b, mul(x, x));
}

int modInvFer(int n) {
    return modPow(n, M - 2);
}

bool bipartite(int u, int cur) {
    col[u] = cur;

    bool ret = 1;

    for (auto v: g[u]) {
        if (col[v] == 2)
            ret &= bipartite(v, !cur);
        else {
            if (col[v] != !col[u])
                ret = 0;
        }
    }

    return ret;
}

void testCase() {
    int n, m, p;
    cin >> n >> m >> p;

    int u, v;
    for (int i = 0; i < m; i++) {
        cin >> u >> v;

        g[u].push_back(v);
        g[v].push_back(u);
    }

    for (int i = 1; i <= n; i++)
        col[i] = 2;

    M = p;

    int sol = 1;
    for (int i = 1; i <= n; i++) {
        if (col[i] == 2) {
            if (bipartite(i, 0))
                sol = mul(sol, 2);
            else {
                cout << "impossible";

                return;
            }
        }
    }

    cout << add(mul(sol, modInvFer(2)), 1);
}

signed main() {
    Beevo

    int T = 1;
//    cin >> T;

    while (T--)
        testCase();

    return 0;
}