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.

[[-6, 83, -124, 9, -190, 76, -8], [48, -10, -88, -125], [5, -33, -85, 83, 31, 4, -125], [53, -95, 41], [-28, -75, -55, 35], [-103, -190]]
[83, 48, 83, 53, 35, -103]

[[-173, -4, 13, -117, 69], [82, -51, -156, 13], [7, 97, 15, -3, -140, -118, -195]]
[69, 82, 97]

[[-92, 53, -200, -116, -142, -143, -38], [44, 7, 18, -110], [-170, 17], [-50, -15, -132, -159], [27, -103, -168, -22, 34, 19, 67], [-8, -77, 6, -142], [-199, 59, 60, -155, -81, -158], [-91, 46, -60, -113, -110, -170], [-167, 5, -89, 65, 32]]

[53, 44, 17, -15, 67, 6, 60, 46, 65]