If $a,b$ are two nonnegative integers with decimal representations $a=(\dots a_2{a}_1{a}_0)$ and $b=(\dots b_2{b}_1{b}_0)$ respectively, then the freshman's product of $a$ and $b$, denoted $a⊠b$, is the integer $c$ with decimal representation $c=(\dots c_2{c}_1{c}_0)$ such that $c_i$ is the last digit of $a_i\cdot b_i$.
For example, $234⊠765=480$.

Let $F(R,M)$ be the sum of $x_1⊠\cdots ⊠x_R$ for all sequences of integers $(x_1,\dots ,x_R)$ with $0\le x_i\le M$.
For example, $F(2,7)=204$, and $F(23,76)\equiv 5870548(\mathrm{mod}1000000009)$.

Find $F(234567,765432)$. Give your answer modulo $1000000009$.