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:
1, 2, ['1907', '1489', 'm', '4571', 'a']

Ex Output:
3396


Ex Input:
5, 9, ['125', 'A', 'E', 'X', 'j', '319', 'm', '7037', 'g', 'D', 'g', '6737', 'z', '5249']

Ex Output:
7356


Ex Input:
4, 20, ['9101', 'M', '9377', 'D', 'V', 'A', '1143', 'T', 'A', 'n', 'b', '6651', '9753', 'H', 'Z', '4665', 'p', 'z', '8531', 'd', '675', 'I']

Ex Output:

30743