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, 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: 8, 9, ['P', 'V', '5567', 'm', 'V', '9533', '2381', '1095', '835', 'B', 'z', 'J', 'H', 't', 'b', 'z', 'e']
Example Output: 1930

Example Input: 13, 29, ['G', '1927', '7361', 'N', '6743', '3871', 'S', 'T', '419', 'W', '3435', 'g', '7449', '3783', 'E', 'm', '9473', '7773', 'Q', '739', 'k', 'y', 'R', '2135', 'l', '8037', '1615', 'v', '2065']
Example Output:
43069