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.
[[-138, -158, 66, 78, 93, 61], [-25, -149, -157], [-107, -159, -46, -133, -24], [-127, 59], [-39, -168, -131, -60], [-40, 39, -180, -111, -102, 39], [-144, -163, -143]]