, possibly with leading zeros. He knows that for m ranges. a_{l_i} times a_{l_i + 1} times dots times a_{r_i} bmod 9 = 0
Bobo has a decimal integer overline{a_1 a_2 dots a_n} a 1 a 2 …a n , possibly with leading zeros. He knows that for m ranges [l_1, r_1], [l_2, r_2], dots, [l_m, r_m] [l 1 ,r 1 ],[l 2 ,r 2 ],…,[l m ,r m ], it holds that a_{l_i} times a_{l_i + 1} times dots times a_{r_i} bmod 9 = 0 a l i ×a l i +1 ×⋯×a r i mod9=0. Find the number of valid integers overline{a_1 a_2 dots a_n} a 1 a 2 …a n , modulo (10^9+7) (10 9 +7).