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.
[[-110, -35, 68, 98, -133, -79, -137], [-133, -187, -173, 28, -19, -167], [-99, -54, -47, -197], [42, -28, -104, -111, -63], [-26, -99, -89, -72, -193, 30], [-200, 46, -163, -189], [-99, -197], [-68, -173], [60, 82, -81]]