Stuck on this question, struggling to see where to start.
Each element of HK is of the form hk, where . But there may be more than one way of representing the same element as such a product.
So suppose that . Then say, where (because and also ).
Use that to count the number of ways that each element of HK can be expressed as a product of the form hk.