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]: 1, 3, ['c', '2957', 'u', '2321', 'q', 'P', '2347', 'O', 'P', '4463', 'u']
[EX A]: 2957

[EX Q]: 4, 5, ['8819', '1879', '4641', '687', '1653', 'u', '1013', '3469', '205', 'h']
[EX A]:
2340