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]: 10, 11, ['L', 'Z', '4501', '4131', 'a', '8057', 'K', 'P', '4713', '8889', 'b', '3927', 'k', '6005', 'T', 'w', 'S', '3963', '2727']
[A]: 8889


[Q]: 5, 6, ['M', '4965', '7693', 'g', 'G', '695', '2401', '5715', 'P', '8197']
[A]: 695


[Q]: 3, 12, ['2073', 'L', 'x', '195', '9929', 'a', '5753', '7681', 'c', '2955', 'q', 'r', 'Y']
[A]:
26513