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]: 9, 9, ['V', 'x', '3763', '8367', '3369', '6695', 'p', 'P', 'L', 'g', 's', '5117', 'n', '5097', '2407', '6337', '5437', 'o', '3023', 'D', 'g']
[EX A]: 0

[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

[EX Q]: 4, 20, ['1073', 'O', '363', '5085', '3615', 'Y', '7375', 'p', '8427', 'Z', '7571', 'S', 'l', 'y', '6987', '9101', '2069', 'q', 'P', '3551', '9837']
[EX A]:
53781