Definition: 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.
Input: 14, 17, ['I', '3861', 'N', '4863', 'l', '4329', 'c', 'V', 'H', 'q', 'm', 'Z', 'Q', 'x', 'M', '8573', 'i', '8643', '7323', '6203', '7345', '2951', '8915', 'a', '4693', 'K', '6729', 'j', '9191', '3537']

8573