using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, k) = (c[0], c[1]);
        var a = NList;
        Array.Sort(a);
        var eq = 0;
        var len = n * (n - 1) / 2 + 1;
        var mod = 1_000_000_007;
        var dp = new long[len];
        dp[0] = 1;
        for (var i = 0; i < n; ++i)
        {
            var ndp = new long[len];
            if (i > 0 && a[i] == a[i - 1]) ++eq;
            else eq = 0;
            for (var j = 0; j < dp.Length; ++j)
            {
                if (dp[j] == 0) continue;
                ndp[j] = (ndp[j] + dp[j]) % mod;
                if (j + i - eq + 1 < len) ndp[j + i - eq + 1] = (ndp[j + i - eq + 1] - dp[j] + mod) % mod;
            }
            for (var j = 1; j < ndp.Length; ++j) ndp[j] = (ndp[j] + ndp[j - 1]) % mod;
            dp = ndp;
        }
        var ans = 0L;
        for (var i = 0; i <= k; ++i) ans = (ans + dp[i]) % mod;
        WriteLine(ans);
    }
}