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.
[[-167, 66, -167, -85, -136, 35], [-159, -193, -17, -150, 70], [-102, -141, -121], [89, -20, 10, -61, 57, -175], [-133, 6, -74], [-182, -43, -132], [-47, 23, -152, -187, -12, -194], [17, -17], [-113, 89, 54, -6, -152]]