import java.io.PrintWriter; import java.util.Arrays; import java.util.HashMap; import java.util.Scanner; import java.math.*; class Main { public static void main(String[] args) throws Exception { new Main().run(); } long[][] mul(long[][] a,long[][] b){ long[][] ret=new long[a.length][b[0].length]; for(int i=0;i0;n>>=1,a=mul(a,a))if(n%2==1)ret=mul(ret,a); return ret; } long pow(long a,long n){ long ret=1; for(;n>0;n>>=1,a=a*a%M)if(n%2==1)ret=ret*a%M; return ret; } long inv(long a){ return pow(a,M-2); } final long M=(long)1e9+7; void run() { Scanner sc=new Scanner(System.in); int N=sc.nextInt(); int W=sc.nextInt(); long K=sc.nextLong(); int[] A=new int[N]; for(int i=0;i