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: 6, 15, ['U', 'E', '6873', '7621', '9241', '147', '4503', 'z', '3805', 'n', '4331', '4031', '2585', '9029', 'a', '7537', '975']
Example Output: 28431

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

Example Input: 7, 11, ['F', '5557', '4073', 'r', '3601', 'K', 'q', 'z', 't', '7965', 'd', 'R', 'p']
Example Output:
7965