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.
[[-160, -54], [-47, 14, -86], [-119, -98, -94, -182, 32, -136, 94], [-81, -166, -29, -47, -163, -48], [-183, 56, -187, -28, 57, 7, -73], [-3, -45, -73, -126, -147], [-161, -38, 75, 56], [-163, -135], [11, -30, 43, -85]]