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]: 6, 7, ['6635', '1537', 'F', 'h', '7965', 'K', '5231', 'K', '3089']
[EX A]: 5231

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

[EX Q]: 4, 11, ['1393', '3231', '525', 'l', 'S', '7453', '8273', 'J', '2135', 'S', '3515', '1069', 'E', '7347', 'o', 'D', 'O', 'X', '4769']
[EX A]:
21376