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: 16, 17, ['Z', '8799', 'Z', 'P', '3413', 'X', '939', 's', 'G', 'x', '6911', 'v', '1183', '3507', 'r', 'C', 'k', 'Z', '4247']
Example Output: 0

Example Input: 2, 2, ['9797', '5585', '1849', '4485', '9225']
Example Output: 5585

Example Input: 6, 12, ['o', 'h', '7475', '2855', '9737', '8909', '8713', 'z', '3147', '4489', '7215', 's', '5831']
Example Output:
32473