Problem: John Doe has an n × m table. John Doe can paint points in some table cells, not more than one point in one table cell. John Doe wants to use such operations to make each square subtable of size n × n have exactly k points.

John Doe wondered, how many distinct ways to fill the table with points are there, provided that the condition must hold. As this number can be rather large, John Doe asks to find its remainder after dividing by 1000000007 (109 + 7).

You should assume that John always paints a point exactly in the center of some cell. Two ways to fill a table are considered distinct, if there exists a table cell, that has a point in one way and doesn't have it in the other.

Input

A single line contains space-separated integers n, m, k (1 ≤ n ≤ 100; n ≤ m ≤ 1018; 0 ≤ k ≤ n2) — the number of rows of the table, the number of columns of the table and the number of points each square must contain.

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier. 

Output

In a single line print a single integer — the remainder from dividing the described number of ways by 1000000007 (109 + 7).

Examples

Input

5 6 1


Output

45

Note

Let's consider the first test case: 

<image> The gray area belongs to both 5 × 5 squares. So, if it has one point, then there shouldn't be points in any other place. If one of the white areas has a point, then the other one also must have a point. Thus, there are about 20 variants, where the point lies in the gray area and 25 variants, where each of the white areas contains a point. Overall there are 45 variants.

Solution (in JAVA):

Solution:
import java.util.Arrays;
import java.util.Scanner;


public class Main {

	/**
	 * @param args
	 */
	static int mod = 1000000007;
	static int N, K;
	static long M;
	public static void main(String[] args) {
		Scanner r = new Scanner(System.in);
		
		N = r.nextInt();
		M = r.nextLong();
		K = r.nextInt();
		
		C = new int[N + 1][N + 1];
		C[0][0] = 1;
		for(int i = 1; i <= N; i++)
		for(int x = 0; x <= N; x++)
			C[i][x] = (C[i - 1][x] + (x - 1 >= 0 ? C[i - 1][x - 1] : 0)) % mod;
		
		d = new int[N];
		for(int i = 0; i < M % N; i++)
			d[i]++;
		
		C_ = new int[N + 1][N + 1][2];
		
		for(int i = 0; i <= N; i++)
		for(int x = 0; x <= N; x++){
			C_[i][x][0] = pow((int)C[i][x], M / N);
			C_[i][x][1] = pow((int)C[i][x], M / N + 1);
		}
		
		DP = new int[N + 1][K + 1];
		
		for(int[] i : DP)
			Arrays.fill(i, -1);
		
//		DP[0][0] = 1;
//		for(int x = 1; x <= N; x++)
//		for(int rem = 0; rem <= K; rem++)
//		for(int p = 0; p <= Math.min(N, rem); p++)
//			DP[x][rem] = (int) ((DP[x][rem] + ((long)C_[N][p][d[x - 1]] * DP[x - 1][rem - p]) % mod) % mod);
		
		long ret = go(N, K);
		
		System.out.println(ret);
	}
	static int[][] DP, C;
	static int[][][] C_;
	static int[] d;
	
	private static int go(int x, int rem) {
		if(x == 0){
			if(rem == 0)return 1;
			else return 0;
		}else{
			if(DP[x][rem] != -1)return DP[x][rem];
			
			int ret = 0;
			for(int p = 0; p <= Math.min(N, rem); p++)
				ret = (int) ((ret + ((long)C_[N][p][d[x - 1]] * go(x - 1, rem - p)) % mod ) % mod);
			
			return DP[x][rem] = ret;
		}
	}
	
	private static int pow(int x, long p) {
		if(p == 0)return 1;
		else{
			if(p % 2 == 0){
				int ret = pow(x, p / 2);
				return (int) (((long)ret * ret) % mod);
			}else{
				int ret = pow(x, p - 1);
				return (int) (((long)x * ret) % mod);
			}
		}
	}

}