# include <bits/stdc++.h>
# define int long long
using namespace std;
const int N=1e6+10,mo=998244353;
int dfn[N],low[N],n,m,tot,head[N],cnt,blo[N],f[N],c;
vector<int>dcc[N];
stack<int>s;
struct rec{int pre,to;
}a[N<<2];
void adde(int u,int v) {a[++tot].pre=head[u];a[tot].to=v;head[u]=tot;
}
int Pow(int x,int n) {int ans = 1;while (n) {if (n&1) ans=ans*x%mo;x=x*x%mo;n>>=1;}return ans%mo;
}
void tarjan(int u) {dfn[u] = low[u] = ++dfn[0]; s.push(u);for (int i=head[u];i;i=a[i].pre){int v=a[i].to; if (!dfn[v]) {tarjan(v); low[u]=min(low[u],low[v]);if (low[v]>=dfn[u]) {int z; ++cnt;do {z = s.top(); s.pop();dcc[cnt].push_back(z);blo[z]++;}while (v!=z);dcc[cnt].push_back(u);blo[u]++;}} else low[u] = min(low[u],dfn[v]);}
}main()
{scanf("%lld%lld%lld",&n,&m,&c);for (int i=1;i<=m;i++) {int u,v; scanf("%lld%lld",&u,&v);adde(u,v); adde(v,u);}f[1] = c; f[2] = c*(c-1) % mo;for (int i=3;i<=n;i++) f[i]=((c*Pow(c-1,i-1)%mo-f[i-1])%mo+mo)%mo;tarjan(1);int ans = 1,ret = 0;for (int i=1;i<=n;i++) ret+=blo[i]-1;for (int i=1;i<=cnt;i++)ans = ans*f[dcc[i].size()]%mo;int ni = Pow(c,mo-2);   ans = ans * Pow(ni,ret) % mo;printf("%lld\n",ans);return 0;
}

# include <bits/stdc++.h>
# define int long long
using namespace std;
const int N=305,mo=998244353;
int n,k;
namespace Subtask1 {int f[N][N][N];void main() {f[0][0][0] = 1;for (int i=0;i<(n+1)/2+k/2;i++)for (int j=0;j<=n;j++)for (int w = 0 ; w <= k+1 ; w++) {(f[i+1][0][0]+=f[i][j][w])%=mo;if (i>=(k/2)) (f[i+1][0][w?w+1:0]+=f[i][j][w])%=mo;if (i<n/2) (f[i+1][j+1][0]+=f[i][j][w])%=mo;if (i>=(k/2) && i<(n/2)) (f[i+1][j+1][max(w+1,j+2)]+=f[i][j][w])%=mo;}int ans = 0;for (int j=0;j<=n;j++)for (int w=0;w<=k+1;w++)(ans+=f[(n+1)/2+k/2][j][w])%=mo;cout<<ans<<'\n';exit(0);}
}
namespace Subtask2 {int f[N][N];int g(int n,int m) {memset(f,0,sizeof(f)); f[0][0] = 1;for (int i=0;i<=n;i++)for (int j=0;j<=m;j++) {f[i+1][0]=(f[i+1][0]+f[i][j])%mo;if (j+1<=m) f[i+1][j+1]=(f[i+1][j+1]+f[i][j])%mo;}int ret=0;for (int i=0;i<=m;i++) ret=(ret+f[n][i])%mo;return ret % mo;}void main() {int ans = 1ll * g((int)ceil((double)n/2.0),k/2) * g(n/2,k/2) % mo;cout<<ans<<'\n';exit(0);}
}
signed main() {cin>>n>>k;if (k&1) Subtask1::main();else Subtask2::main();return 0;
}

# pragma GCC optimize(3)
# include <bits/stdc++.h>
# define Rint register int
using namespace std;
const int N=1e5+1;
struct rec{int l,r,cnt[N];
}tr[318];
int n,m,a[N],blong[N],block,num;
inline int read()
{int X=0; char c=0;while(c<'0'||c>'9') c=getchar();while(c>='0'&&c<='9') X=(X<<3)+(X<<1)+(c^48),c=getchar();return X;
}
void write(Rint x) {if (x>9) write(x/10);putchar('0'+x%10);
}
inline void writeln(Rint x) {write(x); putchar('\n');
}
int query(int l,int r,int d)
{int ret = 0;if (blong[l] == blong[r]) {for (Rint i=l;i<=r;i++)if (a[i]%d == 0) ret++;return ret; }for (Rint i=l;i<=tr[blong[l]].r;i++) if (a[i]%d == 0) ret++;for (Rint i=tr[blong[r]].l;i<=r;i++) if (a[i]%d == 0) ret++;for (Rint i = blong[l]+1 ; i<=blong[r]-1; i++) if (d<=n) ret+=tr[i].cnt[d];return ret;
}
int main()
{n = read(); m =read();for (Rint i=1;i<=n;i++) a[i]=read();block=sqrt(n); num=n/block; if (n%block) num++;for (Rint i=1;i<=num;i++) {tr[i].l=(i-1)*block+1,tr[i].r=i*block;}tr[num].r=n;for (Rint i=1;i<=n;i++) {blong[i]=(i-1)/block+1;for (Rint j=1;j<=sqrt(a[i]);j++) {if (a[i]%j!=0) continue; tr[blong[i]].cnt[j]++; if (j*j!=a[i]) tr[blong[i]].cnt[a[i]/j]++;} }int l,r,d;while (m--) {l = read(),r =read(),d=read(); query(l,r,d);writeln(query(l,r,d));}return 0;
}