Problem Statement

Takahashi has a tower which is divided into $N$ layers. Initially, all the layers are uncolored. Takahashi is going to paint some of the layers in red, green or blue to make a beautiful tower. He defines the beauty of the tower as follows:

• The beauty of the tower is the sum of the scores of the $N$ layers, where the score of a layer is $A$ if the layer is painted red, $A+B$ if the layer is painted green, $B$ if the layer is painted blue, and $0$ if the layer is uncolored.

Here, $A$ and $B$ are positive integer constants given beforehand. Also note that a layer may not be painted in two or more colors.

Takahashi is planning to paint the tower so that the beauty of the tower becomes exactly $K$. How many such ways are there to paint the tower? Find the count modulo $998244353$. Two ways to paint the tower are considered different when there exists a layer that is painted in different colors, or a layer that is painted in some color in one of the ways and not in the other.

Constraints

• $1 ≤ N ≤ 3×10^5$
• $1 ≤ A,B ≤ 3×10^5$
• $0 ≤ K ≤ 18×10^{10}$
• All values in the input are integers.

Input

Input is given from Standard Input in the following format:

N A B K

Output

Print the number of the ways to paint tiles, modulo $998244353$.