#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

constexpr int P = 1000000007;

int main() {
    int n, k;
    cin >> n >> k;

    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    sort(a.begin(), a.end());

    int i1 = n;
    for (int i = 0; i < n; i++) {
        if (a[i] * 2 > k) {
            i1 = i;
            break;
        }
    }

    //自分より小さいやつとしかペアになれない領域
    ll r = 1;
    int m = 0;
    for (int i = n - 1; i >= i1; i--) {
        int j1 = n;//初めて超えたやつ
        for (int j = m; j < n; j++) {
            if (a[i] + a[j] > k) {
                j1 = j;
                break;
            }
        }
        m = j1;
        j1 -= n - 1 - i;
        if (j1 <= 0) {
            r = 0;
            break;
        }
        r = r * j1 % P;
    }
    int i2 = i1 - (n - i1);
    if (i2 < 0) r = 0;
    for (int i = 0; i < i2; i += 2) {
        r = r * (i2 - 1 - i) % P;
    }

    cout << r << endl;

    return 0;
}