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:
1, 6, ['u', 'L', 'm', '9283', 'e', '4615', '7815', '7185', 'h', 'h', '8985', '3987', '1521', 'k', '5715', 'd', 'w', 'T']

Ex Output:
13898


Ex Input:
3, 16, ['T', 'v', '2985', 'F', '8921', 'M', 'F', '4243', 'k', 'x', '435', 'B', '3335', '7613', 'M', '7809', 'q', '4147', 'h', '7523', 'R', '7589', '8795', 'O', 'L', '3371']

Ex Output:
35341


Ex Input:
3, 4, ['9545', '3087', '4057', '1175', 'b', 'L']

Ex Output:

5232