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.

Ex Input:
6, 6, ['I', '8721', '6901', '737', '5767', '9771', 'h']

Ex Output:
9771


Ex Input:
9, 17, ['9485', '5729', 'N', 'v', 'H', 'j', 'K', 'D', 'R', '2515', 'O', '2001', '9877', 'p', 'Y', '8407', '647']

Ex Output:
23447


Ex Input:
6, 7, ['A', '6771', '1585', 'G', '1779', '7227', '3983', 'B', '4667']

Ex Output:

11210