/// tban lecodes el bosta2
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;


#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x,y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;
const int N = 2e5+5, LG = 18, MOD = 1e9+7;
const long double PI = acos(-1);
const long double EPS = 1e-7;

const string TARGET = "WALDO";

int col[1000006];
vector<int> adj[1000006];
bool dfs(int node, int c) {
    if(col[node] != -1)
        return col[node] == c;
    col[node] = c;
    for(auto v : adj[node])
        if(!dfs(v, 1 - c))
            return false;
    return true;
}
void doWork() {

    int n, m, p;
    cin >> n >> m >> p;

    f(i,0,m) {
        int u, v;
        cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }

    memset(col, -1, sizeof col);

    int ans = 1;
    for(int i = 1; i <= n; i++)if(col[i] == -1) {
        if(!dfs(i,0)) {
            cout << "impossible\n";
            return;
        }
        ans = ans * 2 % p;
    }

    ans = ans * ((p + 1) / 2) % p;

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

}
int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE

    int t = 1;
//    cin >> t;
    while (t--) {
        doWork();
    }
    return 0;
}