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.

[[-19, -151], [33, 54, 85]]
[-19, 85]

[[37, 63, 24, -49, -66, 81], [-36, -61, -108], [35, -115], [-24, -143, 65, -63], [-104, 59, -120, -187, 27, -102, 36], [-105, -31, -128, -167, -109], [32, -148, -76, 33, -190, -89], [47, -56, 89, -35, -137, -2, 43], [98, 11, 48, -66, -84, -60]]
[81, -36, 35, 65, 59, -31, 33, 89, 98]

[[-151, -194, -174, -3], [-4, 45, -17], [-163, 6, -63, -83]]

[-3, 45, 6]