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, 9, ['8047', 'Q', 'A', '2811', '8953', 'P', '4515', 'f', 'K', 'u', 'g', 'R', 'p', '667', '8703', '2903', '6299', '417', '3317', 'O', 'z', '3507', '8969', '6193', '2549']
Example Output: 4515

Example Input: 2, 3, ['9773', 'e', 'G', 'm', '1859']
Example Output: 0

Example Input: 7, 10, ['3239', '7575', '7813', 'g', 'u', '4539', '4227', '7737', '1777', 'v', 'U', 'N', '9445', '7503', 'Z', '6455', 'F']
Example Output:
13741