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]: 10, 13, ['W', '5479', 'v', '2193', '8465', '3805', 'e', '7721', '983', 'i', '7843', '6803', '9901', 'K', '375', '165', 'M', 'P', 'a', 'J']
[EX A]: 24547

[EX Q]: 2, 6, ['2495', '83', '1257', '9157', 'z', 'Y', '8689', '385', '747', '1175', 'j', 'U', 'k']
[EX A]: 10497

[EX Q]: 5, 8, ['3017', '2471', 'r', 'M', '8213', '4259', '8397', 'A', '9809', '5827', '4079', 'v', '6735', 'T', 'n', '3877', '9777', '1395', '9631']
[EX A]:
20869

