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, 17, -113], [12, -170, -113, 48, -55, -190, -109], [-92, 86, -199, 53, 60, -129, -38], [-114, 10, 9, 45], [-56, 45, -118, -3], [-30, 89, 84], [34, -130, -76, -136, -105, 46], [-121, 70, -163, -107], [72, -18, 6, 58, 96, -77]]