StepHopJumpMedium

You are traversing a dangerous section of a video game level. The section contains some solid terrain blocks (denoted '-') and some blocks with spiky traps (denoted '*'). If you step onto a trap, you die.

You are given the layout of the level in the String level. You are currently standing on the leftmost block of the level. This block is represented by the character level[0] and it is guaranteed to be a solid block.

Your task is to reach the block at the opposite end of the level. This block is also guaranteed to be solid.

You can move in three ways:

• Take a step (denoted 'S'): move one block to the right.
• Make a hop (denoted 'H'): hop over one block and land two block to the right of your current block.
• Make a jump (denoted 'J'): jump over two consecutive blocks and land three blocks to the right of your current position.

For example, if the level is "----", you can traverse it by making three steps (denoted "SSS"), a hop followed by a step ("SH"), a step followed by a hop ("HS"), or a single jump ("J").

If the level is "-**-", the only way to traverse it is by making a jump - remember that you cannot step onto the spiky traps.

In the above way, we can describe any way of traversing the level as a string in which each character is 'S', 'H', or 'J'. Two ways of traversing a level are considered different if they are described by different strings. For example, there are four ways to traverse the level "----", one way to traverse the level "-**-**-", and no ways at all to traverse the level "-*-****-*-".

Let W be the number of different ways in which we can traverse the level described by the String level. Calculate and return the value (W modulo 1,000,000,007).