#include<bits/stdc++.h>
using namespace std;
#define int long long
vector<int>v[1000006];
bool vis[1000006];
int depth[1000006];
void dfs(int i,int dpth)
{
    vis[i]=1;
    depth[i]=dpth;
    for(auto j:v[i])
    {
        if(!vis[j])
        {
            dfs(j,dpth+1);
        }
    }
}
int power(int b,int p,int m)
{
    if(p == 0)return 1;
    if(p == 1)return b;
    int ret=power(b,p/2,m)%m;
    ret*=ret;
    ret%=m;
    if(p%2 == 1)
    {
        ret*=b;
        ret%=m;
    }
    return ret;
}
void solve()
{
    int n,m,p;
    cin>>n>>m>>p;
    vector<pair<int,int>>edges;
    for(int i=0;i<m;i++)
    {
        int a,b;
        cin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
        edges.push_back({a,b});
    }
    int cnt=0;
    for(int i=1;i<=n;i++)
    {
        if(!vis[i])
        {
            dfs(i,0);
            cnt++;
        }
    }
    for(int i=0;i<edges.size();i++)
    {
        if(depth[edges[i].first]%2 == depth[edges[i].second]%2)
        {
            cout<<"impossible"<<endl;
            return;
        }
    }
    cout<<power(2,cnt-1,p)+1<<endl;
}
int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }

}