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, 4, ['3757', 'z', '9029', '6903', '7185']
Example Output: 19689

Example Input: 4, 15, ['9297', 'c', 'j', 'n', '2351', 's', '8723', 'L', '983', 'g', 'g', '5435', 'c', 'l', 'F', '3421', 'r', 'N', 's', '7889', '743', 'v']
Example Output:
17492