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: 1, 2, ['1907', '1489', 'm', '4571', 'a']
Example Output: 3396

Example Input: 2, 5, ['8407', '1329', '2243', '2547', '5371', '6023', '7139', 'K', '339', '3301', '6771', 'Z', '9983', '17', 'V']
Example Output: 11490

Example Input: 3, 9, ['Z', '5389', 'c', '1329', '4047', 'm', 'p', '9715', 'F', 'x', 'u', 'r', '2735']
Example Output:
15091