I'm reading this article and I don't understand what the authors are doing in Theorem 3, part 1: The authors wanted to compute the cardinality of a $\mathbb{Z}$-module $\Lambda$. They computed the relation matrix $A$ for the module $\Lambda$ (i.e. $\Lambda = coker(A)$):
$A = \begin{bmatrix} l & 0 \\ 0 & m \\ n & n \end{bmatrix}$,
with $l,m,n \ge 1$. They conclude that $\Lambda= \frac{\mathbb{Z}}{d_1\mathbb{Z}} \times \frac{\mathbb{Z}}{d_2\mathbb{Z}}$ with $d_1 = \gcd(l,m,n)$ and $d_2 = \frac{\gcd(lm,ln,mn)}{d_1}$ (and hence that the cardinality $|\Lambda|$ equals to $d_1d_2$).
I don't see where the $\gcd$ comes from and why this statement is true.