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.
import java.io.*;
import java.util.*;
import java.math.*;

import javax.crypto.Cipher;

public class B implements Runnable {
	static BufferedReader in;
	static PrintWriter out;
	static StringTokenizer st;
	static Random rnd;

	final long MODULO = 1000000007;

	// private long solveDumb(int n, int m, int k) {
	// int total = m * n;
	// long res = 0;
	//
	// for (int mask = 0; mask < (1 << total); mask++) {
	// boolean[][] g = new boolean[n][m];
	//
	// int curMask = mask;
	//
	// for (int i = 0; i < n; i++) {
	// for (int j = 0; j < m; j++) {
	// if ((curMask & 1) != 0)
	// g[i][j] = true;
	//
	// curMask >>= 1;
	// }
	// }
	//
	// boolean ok = true;
	//
	// for (int shift = 0; ok && shift <= m - n; shift++) {
	// int cur = 0;
	// for (int i = 0; i < n; i++) {
	// for (int j = 0; j < n; j++) {
	// if (g[i][j + shift])
	// ++cur;
	// }
	// }
	// if (cur != k)
	// ok = false;
	// }
	//
	// if (ok)
	// ++res;
	//
	// }
	//
	// return res;
	// }

	void solve() throws IOException {
		int n = nextInt();
		long m = nextLong();
		int k = nextInt();

		long[][] c = new long[n + 1][n + 1];
		c[0][0] = 1;

		for (int i = 1; i <= n; i++) {
			for (int j = 0; j <= n; j++) {
				long left = (j == 0) ? 0 : c[i - 1][j - 1];
				c[i][j] = left + c[i - 1][j];
				c[i][j] %= MODULO;
			}
		}

		long[][] d = new long[n + 1][k + 1];
		d[0][0] = 1;

		long fullMatches = m / n, remain = m % n;

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

			long curMatches = fullMatches;

			if (i < remain) {
				++curMatches;
			}

			for (int add = 0; add <= n; add++) {
				long ways = binPow(c[n][add], curMatches);

				for (int j = 0; j <= k - add; j++) {
					d[i + 1][j + add] += (d[i][j] * ways);
					d[i + 1][j + add] %= MODULO;
				}
			}

		}

		long res = d[n][k];

		res %= MODULO;

		if (res < 0)
			res += MODULO;

		// out.println(res + " " + solveDumb(n, (int) m, k));
		out.println(res);
	}

	private long binPow(long a, long pow) {
		long res = 1;

		while (pow > 0) {
			if (pow % 2 == 0) {
				a = multMod(a, a);
				pow /= 2;
			} else {
				res = multMod(res, a);
				--pow;
			}
		}

		return res;
	}

	private long multMod(long a, long b) {
		a %= MODULO;
		b %= MODULO;
		return (a * b) % MODULO;
	}

	public static void main(String[] args) {
		final boolean oldChecker = false;

		if (oldChecker)
			new Thread(null, new B(), "yarrr", 1 << 24).start();
		else
			new B().run();
	}

	public void run() {
		try {
			final String className = this.getClass().getName().toLowerCase();

			try {
				in = new BufferedReader(new FileReader(className + ".in"));
				out = new PrintWriter(new FileWriter(className + ".out"));
			} catch (FileNotFoundException e) {
				in = new BufferedReader(new InputStreamReader(System.in));
				out = new PrintWriter(System.out);
			}

			rnd = new Random();

			solve();

			out.close();
		} catch (IOException e) {
			e.printStackTrace();
			System.exit(42);
		}
	}

	String nextToken() throws IOException {
		while (st == null || !st.hasMoreTokens()) {
			String line = in.readLine();

			if (line == null)
				return null;

			st = new StringTokenizer(line);
		}

		return st.nextToken();
	}

	int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}
}