CF1614A.Divan and a Store

Businessman Divan loves chocolate! Today he came to a store to buy some chocolate. Like all businessmen, Divan knows the value of money, so he will not buy too expensive chocolate. At the same time, too cheap chocolate tastes bad, so he will not buy it as well.

The store he came to has $n$ different chocolate bars, and the price of the $i$-th chocolate bar is $a_i$ dollars. Divan considers a chocolate bar too expensive if it costs strictly more than $r$ dollars. Similarly, he considers a bar of chocolate to be too cheap if it costs strictly less than $l$ dollars. Divan will not buy too cheap or too expensive bars.

Divan is not going to spend all his money on chocolate bars, so he will spend at most $k$ dollars on chocolates.

Please determine the maximum number of chocolate bars Divan can buy.

商人迪万热爱巧克力！今天，他来到一家商店购买一些巧克力。和所有商人一样，迪万深知金钱的价值，因此他不会购买过于昂贵的巧克力；同时，过于便宜的巧克力口感不佳，他也不会购买。

这家商店共有 $n$ 种不同的巧克力棒，其中第 $i$ 种巧克力棒的价格为 $a_i$ 美元。迪万认为：若某巧克力棒的价格严格高于 $r$ 美元，则它过于昂贵；若其价格严格低于 $l$ 美元，则它过于便宜。迪万不会购买过于便宜或过于昂贵的巧克力棒。

迪万并不打算将所有钱都花在巧克力棒上，因此他在巧克力上的总花费至多为 $k$ 美元。

请确定迪万最多能购买多少块巧克力棒。

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 100$). Description of the test cases follows.

The description of each test case consists of two lines. The first line contains integers $n$, $l$, $r$, $k$ ($1 \le n \le 100$, $1 \le l \le r \le 10^9$, $1 \le k \le 10^9$) — the lowest acceptable price of a chocolate, the highest acceptable price of a chocolate and Divan's total budget, respectively.

The second line contains a sequence $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le 10^9$) integers — the prices of chocolate bars in the store.

每个测试包含多个测试用例。第一行包含测试用例的数量 $t$（$1 \le t \le 100$）。随后是各测试用例的描述。

每个测试用例的描述由两行组成。第一行包含整数 $n$、$l$、$r$、$k$（$1 \le n \le 100$，$1 \le l \le r \le 10^9$，$1 \le k \le 10^9$），分别表示巧克力的最低可接受价格、最高可接受价格以及 Divan 的总预算。

第二行包含一个序列 $a_1, a_2, \ldots, a_n$（$1 \le a_i \le 10^9$），表示商店中各巧克力棒的价格。

For each test case print a single integer — the maximum number of chocolate bars Divan can buy.

对于每个测试用例，输出一个整数——Divan 最多能购买的巧克力数量。

In the first example Divan can buy chocolate bars $1$ and $3$ and spend $100$ dollars on them.

In the second example Divan can buy chocolate bars $3$ and $4$ and spend $7$ dollars on them.

In the third example Divan can buy chocolate bars $3$, $4$, and $5$ for $12$ dollars.

In the fourth example Divan cannot buy any chocolate bar because each of them is either too cheap or too expensive.

In the fifth example Divan cannot buy any chocolate bar because he considers the first bar too cheap, and has no budget for the second or third.

In the sixth example Divan can buy all the chocolate bars in the shop.

在第一个例子中，Divan 可以购买巧克力棒 $1$ 和 $3$，花费 $100$ 美元。

在第二个例子中，Divan 可以购买巧克力棒 $3$ 和 $4$，花费 $7$ 美元。

在第三个例子中，Divan 可以购买巧克力棒 $3$、$4$ 和 $5$，花费 $12$ 美元。

在第四个例子中，Divan 无法购买任何巧克力棒，因为每根巧克力棒要么太便宜，要么太贵。

在第五个例子中，Divan 无法购买任何巧克力棒，因为他认为第一根巧克力棒太便宜，而对第二根或第三根又没有足够的预算。

在第六个例子中，Divan 可以购买商店中的所有巧克力棒。