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]: 1, 3, ['m', '6287', '41', 'W', '9113', 'P', 'w', 'H', '1651', '8837', '1907', 'e', 'N', 'q', 'j', 'd', 'c', '2459', '6635']
[EX A]: 6328

[EX Q]: 3, 15, ['l', '7213', '6849', '4327', 'V', 'S', '3773', '2583', 'f', '5031', 'J', '5263', 'w', '9777', '2753']
[EX A]: 40356

[EX Q]: 6, 7, ['g', '8723', '7721', 'e', 'C', '6297', '4045', 'r', '4669', 'L', 'S', '3007', '7431', '7037', '4735', '9289', 'I', '9369', '2505', 'g', '7451', 'b', 'w', '7031', '3855', 'K', 't']
[EX A]:
10342