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, 8, ['x', 's', '1415', '6003', '2237', 'g', 'l', 'a', 'l', 'y', 'y', '4651', 'e', 'D', 'g']
[EX A]: 0

[EX Q]: 2, 16, ['2169', 'o', 'D', '8877', '3351', 'p', 'X', '1143', '9633', 'f', '2507', 'S', '5541', 'B', '4543', 'A', 'f']
[EX A]: 35595

[EX Q]: 1, 20, ['C', '4347', '7199', '9355', '3567', 'b', '5133', '7869', 'g', 'N', 'Z', 'u', 'w', '6571', '2563', 'I', 'r', '7933', 'U', 'l']
[EX A]:
54537