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: 8, 13, ['6413', 'n', 'z', 'T', 'R', 'Y', 'D', 'W', 'L', '521', '3411', 'B', 'O', '6757']
Example Output: 3932

Example Input: 17, 17, ['I', 'd', '1961', '8361', 'B', '2463', '197', 'J', '4231', '543', '3629', 'm', '9433', '4359', '633', 'Y', '1339', 'e', '9633', '4531', 'G', '9021', 'k', 'V']
Example Output: 1339

Example Input: 20, 22, ['X', '1323', '2927', '3001', 'K', '2883', 'f', 'U', '8531', '2851', '3101', 'W', 'H', 'u', 'k', 'S', '2093', 'C', 't', '4285', '4389', 'o', '7679']
Example Output:
8674