#include<bits/stdc++.h> using namespace std; #define int long long #define pb push_back #define pii pair<int,int> #define fr first #define sc second #define mk make_pair #define inx(u) int I=h[(u)],v=edge[I].v;I;I=edge[I].nx,v=edge[I].v const int MAXN=600010,N=30,base1=131,base2=171,Mod=998244353,Mod2=998244853; int read(){int x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();return x*f;} bool AAA; int n,m,k,cnt,ans,a[MAXN],p[N][MAXN],id[N],b[N]; map<int,int>mp; void slv(){ n=read(),m=read(),k=read(); for(int i=0;i<n;i++)a[i]=read(); n=min(n,m+k-1),k-=n-m+1; rotate(a,a+k%n,a+n); for(int i=0;i<n-m+1;i++)if(a[i]>a[n-m+1]){puts("0");return;} for(int i=n-m+1;i<n;i++)if(a[i-1]>a[i]){puts("0");return;} k%=n-m+1,k=(n-m+1-k)%(n-m+1); int ans=1; for(int i=1;i<m;i++)ans=ans*i%Mod; int mx=0; for(int i=k,tmp=0;tmp<n-m+1;i=(i+1)%(n-m+1),tmp++)if(a[i]>mx)mx=a[i],ans=ans*m%Mod; printf("%lld",ans); } bool BBB; signed main(){ // freopen("1.in","r",stdin);freopen("1.out","w",stdout); slv(); //cerr<<clock()*1.0/CLOCKS_PER_SEC<<"s\n"<<((&AAA)-(&BBB))/1024.0/1024<<"MB\n"; return 0; }