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:
2, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']

Ex Output:
1351


Ex Input:
2, 8, ['147', 'w', 'Z', 'T', '4591', 'p', 'M', 'O', 'K']

Ex Output:
4591


Ex Input:
5, 5, ['O', 'H', 'O', '6267', '7661', '8915', '6473', 'p', 'S', 'P', 'O', '4453', '4115', 'H', 'x', '4795', 'X']

Ex Output:

7661