#include <bits/stdc++.h>
#define NMAX 100005
#define MOD 1000003

using namespace std;

ifstream f ("elemente.in");
ofstream g ("elemente.out");

int n , k;
int a[NMAX];

long long Pow(int n , int p)
{
    long long nlaput = n , rez = 1;

    while(p)
    {
        if(p % 2 == 1)
             rez = rez * nlaput % MOD;

        nlaput = nlaput * nlaput % MOD;
        p  /= 2;
    }

    return rez;
}

int main()
{
    int i , st = 1 , ans = 0;

    f >> n >> k;

    for(i = 1 ; i <= n ; i++)
        f >> a[i];

    sort(a + 1 , a + n + 1);

    i = 2;

    while(i <= n && st <= n)
    {
        while(a[i] - a[st] <= k && i <= n)
            ++i;

        if(a[i] - a[st] > k || i > n)
            --i;

        ans = (ans + Pow(2 , i - st)) % MOD;
        ++st;
    }

    g << ans;

    return 0;
}