In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[69, 97, 74, -109, 61, -15, 39], [-174, -134, -79, 35, -142, -97], [-137, -106, 69, -90], [29, -16, -200, -135], [20, -107, 41, 82, -192], [-103, 75, -19, -176], [43, -31], [44, 0, 34, -97, -189, 36], [39, -104, 70]]