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.
[[-46, 53, 12], [20, -130], [-198, -193, -18, -92, -115], [-195, 7, -168, -113, -86, -84], [46, 54, -59], [99, 51, -13], [-112, 96, -173, 97, -11]]