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.
[[-113, 87, 80, 93, -135, -85], [-139, -37, 7, -46, 95, -142, -193], [-189, -8], [-39, -150, -48, 68, -60, -165, -193], [66, -55, 62, 51, -43, -97], [-113, 12], [35, -156, 4], [-190, -13, 6, -15, 34, -10]]