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, 5, ['E', '8579', '229', 'X', '1579', 'C', '5091']
Example Output: 10387

Example Input: 6, 7, ['6947', 'l', 'd', '6531', 'X', 'l', '9741', '6553', '9905', 'n', 'Q', 'Y', '2063']
Example Output: 9741

Example Input: 16, 16, ['4013', 'g', '9671', '4469', 'z', '2517', 'E', '4127', 's', 'H', '79', 'K', 'j', 'u', 'U', 'H', 'T', '9225', 'c', 'i', '5817', '1261', 'n', '6571', '9917']
Example Output:
0