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, 14, ['J', '4147', 'z', 'M', 'Z', 'd', 'f', 's', '5083', 'L', '7107', 'g', '7047', 'E', '5931', '141', '6889']
Example Output: 23384

Example Input: 7, 7, ['S', 'a', '1011', '673', '7777', '8529', 'Y']
Example Output: 0

Example Input: 1, 1, ['B', 'E', 'h', '7229', 'y', 'I', 'F', 'P', '2051', '6453', 'W', 'l', 't', 'U', 'O', '9135', 'L', '1165', 'O', '907', '4457', 'w', 'W', 'M']
Example Output:
0