Problem

We start with initial power 1. Given an array in which at each index we can make our power as curr*power[i] or curr/power[i] or do both the operations resulting in no change or skip it.

Given a target array. We need to return a vector where for each target [i] we calculate the number of ways to reach that target. Return with Mod 1e9+7