Sereja has two sequences a₁, a₂, ..., a_n and b₁, b₂, ..., b_m, consisting of integers. One day Sereja got bored and he decided two play with them. The rules of the game was very simple. Sereja makes several moves, in one move he can perform one of the following actions:

1. Choose several (at least one) first elements of sequence a (non-empty prefix of a), choose several (at least one) first elements of sequence b (non-empty prefix of b); the element of sequence a with the maximum index among the chosen ones must be equal to the element of sequence b with the maximum index among the chosen ones; remove the chosen elements from the sequences.
2. Remove all elements of both sequences.

The first action is worth e energy units and adds one dollar to Sereja's electronic account. The second action is worth the number of energy units equal to the number of elements Sereja removed from the sequences before performing this action. After Sereja performed the second action, he gets all the money that he earned on his electronic account during the game.

Initially Sereja has s energy units and no money on his account. What maximum number of money can Sereja get? Note, the amount of Seraja's energy mustn't be negative at any time moment.

The first line contains integers n, m, s, e (1 ≤ n, m ≤ 10⁵; 1 ≤ s ≤ 3·10⁵; 10³ ≤ e ≤ 10⁴). The second line contains n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁵). The third line contains m integers b₁, b₂, ..., b_m (1 ≤ b_i ≤ 10⁵).

Print a single integer — maximum number of money in dollars that Sereja can get.