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.
[[13, 27, -83, 46, -165, -98], [-91, -160, -92, -134, 18], [-119, 62, -49, -16, -26, -56], [-88, 53], [-34, -61, -39, -144, -192], [75, -15, 78, -81]]