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.
3, 17, ['9199', 'V', '6033', '4193', 'n', 'q', '5339', 'Z', '6813', 'q', 'N', '1159', 'z', '1575', '9567', 'V', 'm', 'O', 'H', '2097', 'H', '9937', '7663', 'F', 'N', '1839']