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, 5, ['O', 'T', 'V', '9035', 'L', 't', 'I']

Ex Output:
9035


Ex Input:
5, 9, ['X', '6543', '1123', '5967', 'x', '9197', '2865', 'r', 'V', 'c']

Ex Output:
12062


Ex Input:
6, 9, ['J', '5177', 'm', '7413', 'T', 'N', '5153', 'S', '8145']

Ex Output:

13298