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:
5, 6, ['x', 't', '9767', '4787', 'T', 'e', 'Y', '8919']

Ex Output:
0


Ex Input:
10, 12, ['h', 'C', 'q', '7869', 'S', '2545', '3607', '8257', '165', '6373', 'X', '2481', 'a', '5803', '9191', 'v', 'c', 'k', '8077']

Ex Output:
8854


Ex Input:
4, 5, ['Z', 'c', '4229', '2035', 'g', 'C', '1757', 'j', '183', 'Y', '7389', '2445', '931', '7419', 'j']

Ex Output:

2035