Graphs and Degrees · Medium problem

In the complete bipartite graph $K_{3,5}$ (left side $L_1,L_2,L_3$, right side $R_1,\ldots,R_5$), how many walks of length $3$ go from $L_1$ to $R_1$?