what is big O time complexity of the following algorithm

for i $=1$ to m:

for j$=1$ to n

C$\_$ij$=0$

for q$=1$ to k

C$\_$ij$=$C$\_$ij $+$ iq$*$b$\_$qj

return $[$C$\_$ij$]$