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.
[[48, -119, -81, -199, 18, 39], [-197, -35], [-94, -66, 66, -186], [-76, -77, -41, -187, -59, -2, 73], [40, -84, 27, -74, -124, -44, 19], [44, -56, -4, -151, -168, -181]]