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, 6, ['g', '8871', 'q', '597', '8871', '277', 'f', 'e', '2779']

Ex Output:
9745


Ex Input:
5, 15, ['r', '6933', '8849', '3479', 'H', '4269', '7469', '9359', 'K', '3371', 'A', '5371', 'z', 'K', '6147', 'i', 'Q', '9055', 'b', 'g', 'x', '5357', 'L', '2797', '7683', 'L', '7127', 'M']

Ex Output:
35986


Ex Input:
2, 8, ['6953', 'i', '8153', 'i', '1901', 'e', 'o', '6967', 'T', 'D', 'r', '4071', 'G', '5409', 'f', '1077', '1949', 'Q', '7297', 'j', '6605', 'e', 'z', 'H', '8863', '4635', 'C', '3709', '2405']

Ex Output:

17021