2.16([Usaco2005 Nov]Ant Counting)

描述

Bessie was poking around the ant hill one day watching the ants march to and fro while gathering food. She realized that many of the ants were siblings, indistinguishable from one another. She also realized the sometimes only one ant would go for food, sometimes a few, and sometimes all of them. This made for a large number of different sets of ants!

Being a bit mathematical, Bessie started wondering. Bessie noted that the hive has T (1 <= T <= 1,000) families of ants which she labeled 1..T (A ants altogether). Each family had some number Ni (1 <= Ni <= 100) of ants.

How many groups of sizes S, S+1, ..., B (1 <= S <= B <= A) can be formed?

While observing one group, the set of three ant families was seen as {1, 1, 2, 2, 3}, though rarely in that order. The possible sets of marching ants were:

3 sets with 1 ant: {1} {2} {3}
5 sets with 2 ants: {1,1} {1,2} {1,3} {2,2} {2,3}
5 sets with 3 ants: {1,1,2} {1,1,3} {1,2,2} {1,2,3} {2,2,3}
3 sets with 4 ants: {1,2,2,3} {1,1,2,2} {1,1,2,3}
1 set with 5 ants: {1,1,2,2,3}

Your job is to count the number of possible sets of ants given the data above.

输入

* Line 1: 4 space-separated integers: T, A, S, and B

* Lines 2..A+1: Each line contains a single integer that is an ant type present in the hive

输出

* Line 1: The number of sets of size S..B (inclusive) that can be created. A set like {1,2} is the same as the set {2,1} and should not be double-counted. Print only the LAST SIX DIGITS of this number, with no leading zeroes or spaces.

样例输入

3 5 2 3
1
2
2
1
3

样例输出

10

翻译:

描述

一天，贝西在蚁丘周围闲逛，看着蚂蚁在觅食时走来走去。她意识到许多蚂蚁都是兄弟姐妹，彼此之间没有什么区别。她还意识到，有时只有一只蚂蚁会去觅食，有时是几只，有时是所有的蚂蚁。这就产生了大量不同种类的蚂蚁!

贝西有点数学的意思，开始想。贝西注意到蜂巢中有T (1 <= T <= 1000)个蚂蚁家族，她把这些蚂蚁归为1。T(全部是蚂蚁)。每个家族都有一个编号为Ni (1 <= Ni <= 100)的蚂蚁。

有多少组大小是S S+1…， B (1 <= S <= B <= A)可以形成?

当观察一个群体时，三个蚂蚁家族的集合被视为{1,1,2,2,3}，尽管很少按照这个顺序。行军蚂蚁的可能集合是:

3组1个蚂蚁:{1}{2}{3}

5个蚂蚁集合:{1,1}{1,2}{1,3}{2,2}{2,3}

5集3蚂蚁:{1 1 2}{1 1 3}{1,2,2}{1,2,3}{2 2 3}

{1,1,2,2} {1,1,2,2} {1,1,2,3}

1组5只蚂蚁:{1,1,2,2,3}

你的工作是根据上面的数据计算可能的蚂蚁集合的数量。

输入

第1行:4个用空格分隔的整数:T, A, S, B

第2行A+1:每一行包含一个单一的整数，它是蜂巢中存在的蚂蚁类型

输出

第一行:可以创建的大小为S..B(包括)的集合的数量。像{1,2}这样的集合和{2,1}是一样的，不应该被重复计算。只打印该数字的后6位，前6位不能有0或空格。

样例输入

3 5 2 3
1
2
2
1
3

样例输出

10