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.

Example Input: 5, 16, ['a', '2439', 'p', '6759', 'z', '2233', 'q', '1447', 'Y', 'k', 'Y', 'Y', '4489', 'N', '5251', '5367']
Example Output: 18787

Example Input: 4, 5, ['b', 'u', '5279', '6945', '6631']
Example Output: 13576

Example Input: 6, 7, ['k', 'F', 'I', '1481', 'v', '5085', 'V', '9661', '525']
Example Output:
5085