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: 6, 10, ['5601', '3783', '7919', '9195', 'G', 'J', 'L', 'X', 'O', 'F', '2479', 's', 'H', '5353', '7079', '2199', '2937', 'S']
Example Output: 0

Example Input: 1, 6, ['3309', 'w', '1143', 'D', 'Z', 'd']
Example Output: 4452

Example Input: 13, 14, ['7097', 'f', '7225', 'j', '2419', 'W', '2371', 'd', '8331', '9681', 'z', '8927', 'V', '9453', 'b', '6287']
Example Output:
9453