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]: 21, 27, ['2789', '3875', '2351', 'Y', '1127', 'J', 'Z', '5187', 'c', '8115', '3459', 'Y', 'f', 'o', 'L', 'H', '2931', '879', 'L', 'e', '3745', '173', 'v', 'W', '9393', 'Y', '7651']
[A]: 20962


[Q]: 3, 14, ['8305', 'q', '9455', '9395', '8619', '8071', '5379', '1109', '2481', '461', '6235', '2597', 'r', '8289', 'J']
[A]: 62091


[Q]: 4, 4, ['2107', 'l', '7551', '4907']
[A]:
4907