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.

[[-187, -74, -95, -170, -190, -61, -119], [-151, -197], [63, -132, -145, -124], [-169, -69, -48, -114], [-31, -89, -187, -198, -63, 2], [66, 19]]
[-61, -151, 63, -48, 2, 66]

[[79, -185, 24], [38, 8, 46, 27, -43, -100]]
[79, 46]

[[81, -108, -143, -93, -181, 88], [-12, 1, -39], [-90, -38, -41, 15], [-193, -166, -175, -83, 49, -152, 62], [-146, -174], [-134, -53, 89, -194, 8, -113]]

[88, 1, 15, 62, -146, 89]