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, 2, ['R', '979', 'H', 'W', 'y']

Ex Output:
979


Ex Input:
4, 17, ['n', 'U', 'b', '6139', '4187', '757', '2059', '5677', 'O', 'n', '73', 'F', '2573', 'K', 'I', '8921', '1483', 'C', '319', '7525', 'X', '3031', 'A', '6693', 'q', '549', 'N']

Ex Output:
31869


Ex Input:
20, 22, ['P', 'g', '6595', '7179', 'q', 'B', '4305', '857', '3273', '735', 'B', 'k', '8391', '8115', '2263', 'W', '4241', '7015', 'u', '9025', '3313', '6643', '251', 'e', 'o', '9417']

Ex Output:

18981