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.
[[-179, 19, -88, 58, -135, -193], [-96, 71, -157, 32], [-131, -123, 70, -15, 83], [81, 38, -11, 21, -106, -137], [-149, -138, -116, -128, 56, -110, 21], [-157, -134, 60, -172, -27], [-197, -155, -132, 16, 0, -133], [-22, 34]]