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: 2, 10, ['f', 'r', 'Z', '1989', '5035', '1623', '9335', '7495', '8663', '2199', '2047', 'o']
Example Output: 36339

Example Input: 1, 18, ['1137', '7521', '1291', 'o', '391', '5329', 'X', '391', 'i', '6893', '8547', '9361', 'Z', 'O', '9701', '4097', '9273', '3877', '1589', '9097']
Example Output: 67809

Example Input: 4, 8, ['B', 'g', '2197', 'E', '9255', '4123', '4023', '7415', 'X', '8167', 'd', 'l', 'a', '181']
Example Output:
24816