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.
[[55, -115, 73, -60, -49], [-68, -10, -195, -128, -69, 22], [-186, 18], [-145, 46, -51, -50, -151, -23, 78], [59, 5, -184, 43, 64, -84, -192], [9, -73, -112, -194, -146, -136, 81], [-51, -130, -41, -81], [-176, 70, 67, -151, 56, -147, 14], [20, 71, 75]]