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: 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: 1, 3, ['g', 'g', 'K']
Example Output: 0

Example Input: 14, 20, ['5907', '6065', 'k', '8289', 'f', 'Q', 'a', 'Q', '7205', 'G', 'Q', 'V', 'W', 'A', 's', '6947', '3411', '1121', 'D', '2395', 'S', '7313', 'C']
Example Output:
13874