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 Q]: 5, 16, ['t', 'r', 'O', 'q', 'B', '6327', 'f', 'R', 'H', '4429', 'o', '5347', 'U', 'h', '7067', '237', 'i', 'k', 'K', '461', 'L', '4105', 'i', '6483']
[EX A]: 23407

[EX Q]: 4, 5, ['b', 'u', '5279', '6945', '6631']
[EX A]: 13576

[EX Q]: 7, 22, ['5535', '2581', 'c', '1363', 'e', '1725', '9129', '6803', 'Y', 'z', '8287', 'N', 'n', 'g', 'h', 'B', '8397', 'z', 'J', '4923', '8585', 'F', 'K', '9023', '8097', 'L', 'G']
[EX A]:
46124