Determine the count of binary boards with dimensions $n$ rows and $m$ columns, where no two adjacent numbers are both equal to $1$.
### Input
- A single line contains two integers $n,m$.
### Output
- Print the number of boards modulo $10^9+7$.
### Constraints
- $1 \le n \le 10$.
- $1 \le m \le 200$.
### Example
Input:
```
3 4
```
Output:
```
227
```
