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.
[[-113, -74], [-131, -95, -17, -65], [-109, -72, 56, -75], [30, -21, 60, 8, -92, 55, 19], [83, 62, -81, -45, 6, -52, 19]]