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:
11, 12, ['S', 'f', 'V', '7983', 'O', 'k', '699', '2831', 'C', 'B', 'B', '1263', 'b', '509', '8963', '8895']

Ex Output:
1263


Ex Input:
1, 2, ['5605', '6415']

Ex Output:
12020


Ex Input:
2, 11, ['3023', 'z', 'x', '1987', 'X', 'B', '7015', 'T', '4517', 'G', 'Y', '8149']

Ex Output:

13519