Bell Numbers Modulo Factorial

Let $B(n)$ be the $n$-th Bell number, which can be computed as $B(0)=1$ and $B_{n+1}=\sum _{k=0}^n(\genfrac{}{}{0ex}{}{n}{k})B_k$ for $n\ge 0$.

For example, $B(5)=52$ and $B(10)=115975$.

Let $f(N,M):=B(N)modM$.

You can verify that $f(5,24)=4$, $f(10,8!)=35335$ and $f({10}^4,12!)=82759235$.

Find $f({10}^7,30!)mod({10}^9+7)$.