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.
[[-112, 25, -93], [28, -32, 33], [-145, -73, -143, 56, -167, -53], [-16, -63, -73, 7, 85, -109], [-28, -165, -7, 90], [0, -13, 6], [-21, 44, -15, -7], [-71, 68, -64, 31]]