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.
[[-46, -29, -18, -129, -185, 19, 60], [-97, -90, 61], [-129, 21, -19, -191, -110, -105], [62, 15, 20], [-50, 23, -21, 59, -186, -142], [56, -34, -187, -168], [37, 72, 16], [-133, 96, 67, 24, -16, 43], [-45, 43, -34, 19]]