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, -69, -153, -73], [-136, -112, -133], [30, -31], [59, -147, -105, 23, 54], [49, -59, 65, -41, -42, 22], [-133, -88, -102, -7], [-16, -96, -138, -48, -52], [-95, 86, -35, 37, 59, -151], [39, -117, -124, -196]]
[-19, -112, 30, 59, 65, -7, -16, 86, 39]

[[-163, -60, 37, -195, -36, 3], [-32, 75, -1]]
[37, 75]

[[-70, 94, 6, 27, -6], [-37, 39], [-34, 21, -196, -134], [-3, -73, -184, 100, -30, -74], [-166, -5, -5, -126], [-143, -162, -59, -46, -133]]

[94, 39, 21, 100, -5, -46]