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.
[[47, -36, -140], [-140, -114, 60, -142, 6, 38, -117], [-30, -165, -66, -174, 46], [57, -82, -64, 15, -50, -38], [-160, -130, 6, -11, -20], [49, -170, -98, -15, -147, -195, -69], [9, -166, 24, 47, -118], [-126, -97, 95, -27], [46, -133, 40, -91, 49]]