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.

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


[Q]: 1, 5, ['V', '9481', '9901', '7235', '5281', '2719']
[A]: 31898


[Q]: 2, 16, ['Z', '4785', 'f', 'W', 'o', '2843', 'Y', 'w', '1765', '3261', 'y', '4471', 'Y', 'e', '5709', 't', '6661', 'w', 'J', 'P', '6817', '2759', 'c']
[A]:
22834