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:
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:
3, 6, ['w', 'V', '7413', '5027', 's', '7037', 'S', '763', 'D', 'U', 'x', 'l', '9331', 'S', 'k', '8369', 'D', 'A', 'e', 'A', 'r', '5113', '1367', '4197', 'm']

Ex Output:
19477


Ex Input:
1, 17, ['G', '4115', 'H', '5907', '6601', '9001', '8585', 'e', 'n', '361', 'Y', 'x', 'X', '445', '9719', 't', 'H', 'j', '8245', '1159', 'a', '5185', 'g', 'F', '3709', 'u', '5047', '5361', '9733']

Ex Output:

44734