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:
9, 16, ['u', '81', '19', '5877', 'F', '6479', 'v', '4187', 'M', 'a', '4309', 'z', 'u', '55', 'w', 'W', '7471', 'b', 'k', 'W', '8785', 'y', 'n', 'q', 'G']

Ex Output:
4364


Ex Input:
3, 7, ['k', 'm', 'W', '641', 'X', 'B', '897']

Ex Output:
1538


Ex Input:
7, 8, ['d', '6915', '2183', 'v', '6733', 'H', '1201', 'F', '97', '6981', '7325', 'v', '151', '8549', '9213', '5751', '1177']

Ex Output:

1201