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.

[[-33, -17, 16, -125], [-15, 51, -194, -36, -4, 40], [-163, -197, -185, 99, -114, -157, 41], [35, -1, -14, -73, -149]]
[16, 51, 99, 35]

[[-92, 82], [-90, 37], [-135, -183], [-140, 37], [-156, -132, -162, -185], [28, 67, -110, -50, -53]]
[82, 37, -135, 37, -132, 67]

[[64, 2, -175, -88], [38, -168, 54], [7, -138, -75, 81, -181], [-172, -66, 69, 68, -103], [75, -91, -70]]

[64, 54, 81, 69, 75]