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: 4, 4, ['t', 'Z', '8689', 'I', '5589', 'H', 'Z']
Example Output: 0

Example Input: 2, 10, ['f', 'r', 'Z', '1989', '5035', '1623', '9335', '7495', '8663', '2199', '2047', 'o']
Example Output: 36339

Example Input: 4, 18, ['4577', 'V', '6643', 'k', 's', '8071', '4147', 'G', 'C', '431', '8153', 'a', 'C', '3001', '3403', 'T', 'l', '753', 'd', '7325', '4011', '1795', 'Y', '5271', 'b', 'A']
Example Output:
27959