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:
3, 5, ['3515', '4581', '8863', '2037', '7899', 'N']

Ex Output:
18799


Ex Input:
4, 5, ['677', '5585', 'W', 'J', 'C']

Ex Output:
0


Ex Input:
2, 5, ['735', '2369', '5421', '9663', '3937', 'u', '2241', 'e', 'e', '8423', '3045', 'j', '799', '3379', 'b', 'G', 'J', '2427', '2003', 'r', '8811', 'B', '2523', '9377', '4843']

Ex Output:

21390