#include <bits/stdc++.h>
using namespace std;
#define ll long long
int tt, tc;

void solve() {
    int n, m, p;
    cin >> n >> m >> p;
    vector<vector<int>> g(n);
    vector<int> vis(n);
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    auto process = [&](int v) {
        queue<int> q;
        q.push(v);
        vector<int> color(n);
        color[v] = 1;
        while (!q.empty()) {
            int c = q.front();
            q.pop();
            vis[c] = 1;
            for (int u : g[c]) {
                if (color[u]) {
                    if (color[u] != 3 - color[c]) return false;
                } else {
                    color[u] = 3 - color[c];
                    q.push(u);
                }
            }
        }
        return true;
    };

    int ans = 1;
    int take = 0;
    for (int i = 0; i < n; i++) if (!vis[i]) {
        if (!process(i)) return void(cout << "impossible" << "\n");
        if (take) ans = (ans + ans) % p;
        take = 1;
    }

    cout << (ans + 1) % p << "\n";
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    tt = 1, tc = 1; // cin >> tt;
    while (tt--) solve(), tc++;
}