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.
[[15, -143, 97, -33], [-129, 60, 34, -141], [-74, -62, 85, -139, -23, 1], [-91, -28], [-6, -90, -144, -122, 46, -81]]