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

 #include <cstdio>//sprintf islower isupper

 #include <cstdlib>//malloc  exit strcat itoa system("cls")

 #include <iostream>//pair

 #include <fstream>//freopen("C:\\Users\\13606\\Desktop\\草稿.txt","r",stdin);

 #include <bitset>

 //#include <map>

 //#include<unordered_map>

 #include <vector>

 #include <stack>

 #include <set>

 #include <string.h>//strstr substr

 #include <string>

 #include <time.h>//srand(((unsigned)time(NULL))); Seed n=rand()%10 - 0~9;

 #include <cmath>

 #include <deque>

 #include <queue>//priority_queue<int, vector<int>, greater<int> > q;//less

 #include <vector>//emplace_back

 //#include <math.h>

 //#include <windows.h>//reverse(a,a+len);// ~ ! ~ ! floor

 #include <algorithm>//sort + unique : sz=unique(b+1,b+n+1)-(b+1);+nth_element(first, nth, last, compare)

 using namespace std;//next_permutation(a+1,a+1+n);//prev_permutation

 //******************

 int abss(int a);

 int lowbit(int n);

 int Del_bit_1(int n);

 int maxx(int a,int b);

 int minn(int a,int b);

 double fabss(double a);

 void swapp(int &a,int &b);

 clock_t __STRAT,__END;

 double __TOTALTIME;

 void _MS(){__STRAT=clock();}

 void _ME(){__END=clock();__TOTALTIME=(double)(__END-__STRAT)/CLOCKS_PER_SEC;cout<<"Time: "<<__TOTALTIME<<" s"<<endl;}

 //***********************

 #define rint register int

 #define fo(a,b,c) for(rint a=b;a<=c;++a)

 #define fr(a,b,c) for(rint a=b;a>=c;--a)

 #define mem(a,b) memset(a,b,sizeof(a))

 #define pr printf

 #define sc scanf

 #define ls rt<<1

 #define rs rt<<1|1

 typedef long long ll;

 const double E=2.718281828;

 const double PI=acos(-1.0);

 //const ll INF=(1LL<<60);

 const int inf=(<<);

 const double ESP=1e-;

 const int mod=(int);

 const int N=(int)5e5+;

 int read(){

     int x=,f=;char ch=getchar();

     for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-;

     for(;isdigit(ch);ch=getchar())x=x*+ch-'';

     return x*f;

 }

 ll qpow(ll a,ll b,ll mod)

 {

     ll ans;

 //    a%=mod;

     ans=;

     while(b!=)

     {

         if(b&)

             ans=(ans*a)%mod;

         b/=;

         a=(a*a)%mod;

     }

     return ans;

 }

 bool vis[N];

 ll dep[N];

 vector<vector<int> >G(N);

 ll loop,other,ans;

 void dfs(int u,int v)

 {

 //    cout<<u<<' '<<v<<endl;

     if(vis[v])

     {

         if(dep[u]<=dep[v])return;

         ans*=qpow(,dep[u]+-dep[v],mod)-;

         ans=(ans+mod)%mod;

         loop+=dep[u]+-dep[v];

         return;

     }

     vis[v]=;

     dep[v]=dep[u]+;

     int sz=G[v].size();

     for(int i=;i<sz;++i)

     {

         int to=G[v][i];

         if(!dep[v]<=dep[to]&&to!=u)

         {

             dfs(v,to);

         }

     }

 }

 int main()

 {

     int n,way;

     while(~sc("%d%d",&n,&way))

     {

         ans=;loop=other=;

         for(int i=;i<=n;++i)

             G[i].clear(),dep[i]=vis[i]=;

         for(int i=;i<=way;++i)

         {

             int u,v;

             u=read(),v=read();

             G[u].push_back(v);

             G[v].push_back(u);

         }

         //    bfs({0,1});

         dfs(,);

         other=way-loop;

         ans*=qpow(,other,mod);

         ans%=mod;

         //    if(loop==0)ans=0;

         pr("%lld\n",ans);

         //cout<<loop<<' '<<other<<endl;

     }

     return ;

 }

 /**************************************************************************************/

 int maxx(int a,int b)

 {

     return a>b?a:b;

 }

 void swapp(int &a,int &b)

 {

     a^=b^=a^=b;

 }

 int lowbit(int n)

 {

     return n&(-n);

 }

 int Del_bit_1(int n)

 {

     return n&(n-);

 }

 int abss(int a)

 {

     return a>?a:-a;

 }

 double fabss(double a)

 {

     return a>?a:-a;

 }

 int minn(int a,int b)

 {

     return a<b?a:b;

 }