In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
7, 10, ['8757', '3281', '7555', '8923', '2973', '4809', '4315', '9905', 'S', '7543', 'p', '5339', 'V', 'z', '1995', 'S', 'p', 'z', 'W']