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.
[[61, -73, -155, -54, -32, 68], [-118, -123, 76, -52, -28, 83, 92], [-30, 44, -190], [83, -82, 53, -151, 33, -141, -150], [-185, -165, -70], [1, 97, 73, -128], [43, -7, 70, 21, 73, -143, 51], [29, -192]]