Given a list of integers and a positive integer k, return a new list with every k-th element (1-indexed) removed. If k is less than or equal to 0, return a shallow copy of the original list. Maintain the original order of the remaining elements.
([1, 2, 3, 4, 5, 6, 7, 8], 3)[1, 2, 4, 5, 7, 8]