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.

[[-188, -197, -169], [-122, 14, -180, -164, 67, 0, 29]]
[-169, 67]

[[-153, -194, 66, -24], [-9, -170, -188, -20, 16], [-160, -44, -44, 16, 2, -146], [10, -66, -148, 69, -48], [12, -55, -153, -2, -11], [-149, 38, 27, -107, 80, -183]]
[66, 16, 16, 69, 12, 80]

[[48, -26], [86, 65, -135, -88, -123, -118], [-158, -26], [16, -134, -84], [-71, -105, 83, 55, -41, -54], [-81, 32, -200, -81, -41], [-198, 3, 19, -86, -43, -179]]

[48, 86, -26, 16, 83, 32, 19]