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.
[[-123, 34, -21, -136, -170, -170, -197], [36, 1, 9, -134, 79, -158], [-129, -93, -13], [93, -16, -160, 37, 25], [44, 59, -108], [82, -113]]