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]: 3, 4, ['h', 'w', 'L', 'L']
[EX A]: 0

[EX Q]: 1, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']
[EX A]: 0

[EX Q]: 5, 9, ['g', 'N', '1355', '6563', 'O', '2655', 'U', 'e', '2935', '3981', '5067', '8589', '7331', 'O', '5409', '3591', 'w', '8669', 'u']
[EX A]:
5590