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.
[[-116, -146], [-67, -58], [-107, -182, -166, -111, 41], [-159, -96, 43], [-20, 61, 86, -140, -184, 23, -14], [81, -137, -120, -41, -88], [-155, -30, -108, -94, -192, -39], [-21, -153, 86, -183, 32, 19]]