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:
2, 8, ['743', '3417', '5979', 'J', 'f', '4707', 'k', 'i', '2167', 'V', 'g']

Ex Output:
14103


Ex Input:
6, 7, ['1595', '1523', '157', 'I', '3929', '6313', 'H', 'f', 'e', '93', '5625', 'b', 'J', 'b', '1185', '1505', 'I', 'y', '4043']

Ex Output:
6313


Ex Input:
3, 7, ['11', 'H', '7019', 'o', 'C', 'E', 'S', '9253', 'h', '8297', '2983', 'Z', 'z', 'w', '2757', 'r', '405', 'w', 'w', 'T', '9473', 'S', 'x', 'S', 'L']

Ex Output:

7019