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, 11, ['p', '2293', '3291', '4843', 'i', '1303', 'R', '9315', '2485', '8477', 'V', '9629', 'v', '6959', '3019']
Example Output: 32007

Example Input: 2, 8, ['r', 'H', 'K', 'K', '7307', 'i', '9381', '4175']
Example Output: 20863

Example Input: 5, 9, ['583', '463', 'P', 'i', '9207', 'j', 'g', 'K', 'L', '4111']
Example Output:
9207