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:
5, 14, ['r', '5851', '5957', '1951', '9761', '6805', '2323', 'J', '703', '9479', '6653', 'L', '513', 'A', 'v', '4273', '391', 'b']

Ex Output:
36237


Ex Input:
6, 16, ['P', '8933', '2757', 'y', 'p', '6687', '6903', 'S', 'b', '7221', 'V', 'B', '3633', 'G', '1209', 'J', '641', '1449', 's', 'w', 'C', '5801', 'Y']

Ex Output:
25653


Ex Input:
3, 12, ['C', 'b', '847', '2447', '3113', 'D', 'e', 'B', '8249', '3989', '8643', 'k', '7581', '2269', '5283', '4105', '4229', 'a']

Ex Output:

27288