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.

[[-18, -69, 27, -166, -146, -169], [-11, -183, -102, -104, -33, 65, -19], [-27, -147], [-41, -126, -9, -125], [-28, -26], [-33, -92]]
[27, 65, -27, -9, -26, -33]

[[-191, 34, 74, -110, -118, -35], [-128, 36, -145, 50, -127, 78, 43], [-166, -132], [-60, -144, -107, -52, -2, 63], [73, -89, -1, 35, -16], [-84, 39]]
[74, 78, -132, 63, 73, 39]

[[-183, 74, -103, -67], [-3, -120, -160], [-104, 83, -184, -171, -156, -60], [-6, -127, -39, -139], [-113, -82, -109, -27, -195], [-126, -159, -144, -59, -80, -184, -116], [-194, -194, -53, 5, -151, -80, -168]]

[74, -3, 83, -6, -27, -59, 5]