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: 5, 10, ['8553', '4157', 'm', 'Q', 'u', 'j', 'X', 'r', '8579', '255', 'A', 'g', '7017', '5707', 'd', 'O', 'V', 's', 'p', '337', 'F', '5439', '5715', 'c', '2615', 'l', '3537']
Example Output: 8834

Example Input: 1, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']
Example Output: 0

Example Input: 1, 5, ['g', '9805', 'C', 'A', 'O', '8739', 'Z', '2053', 'z', 'C', 'q', '5189', 'Q', 's', '1333', 'D']
Example Output:
9805