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: 4, 12, ['f', '3507', 'T', 's', '9209', 'T', 'o', '769', 'U', 'i', 'V', '5723', '2151', 't', 'Z', '5857', '951', '3261', 'd', '407', 'X', '1869', '1483', '3631', '2949']
Example Output: 15701

Example Input: 4, 5, ['1427', '7597', '765', 't', '7057', 'f', 'B', 'k']
Example Output: 7057

Example Input: 1, 2, ['H', '5021', 'w', 'g', '2959', '3591']
Example Output:
5021