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.
[[11, 61, 53], [-31, -81], [34, 63, -13, -61, 39, -162], [-20, 94, 65], [-174, 2, -110, -34], [-149, -127, -2, -49, -136, -103], [-71, -22, -28, 89, -178], [-114, -181]]