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, 7, ['6261', 'l', 'T', 't', 'X', 'G', 'Y', 'f']

Ex Output:
0


Ex Input:
2, 2, ['R', '979', 'H', 'W', 'y']

Ex Output:
979


Ex Input:
2, 13, ['h', '9531', '9179', '7901', 'U', 'k', 'C', '6265', '3695', 'x', 'V', '7297', 'N', '9967', 'N', '2363', '9975', '1791', 'x', 'u', 'V', 'p', '2093', 'J', '6209']

Ex Output:

43868