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: 7, 12, ['3713', 'N', '7191', '73', '4595', '6537', 'H', 'v', 'H', '8531', 'k', 'H', 's', 'x', 'R', 'd', '507', 'C', '9649', '8875', '7931']
Example Output: 8531

Example Input: 2, 10, ['1711', '201', '6463', 'J', 'z', 'D', 'I', 's', '2161', 'I', '2479', '4475', '2519', '7511']
Example Output: 8825

Example Input: 1, 1, ['F', '4429', '7861']
Example Output:
0