Let a$1,...,$am and b$1,...,$bn be two sequences of digits. Consider the following algorithm:

s$0$

for i $\{1,...,$ m$\}$ do:

for j $\{1,...,$ n$\}$ do:

ss$+$aibj

How many multiplications will this algorithm conduct?

How many times will this algorithm do the operation?