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]: 1, 2, ['E', 'z']
[A]: 0


[Q]: 12, 17, ['3889', 'F', 'E', '8903', '2149', '2549', '5827', '7333', '1321', '3', 's', 'e', '2009', '711', 'Q', '7555', 'T', '8479', '8685', 'Y', 'W']
[A]: 10275


[Q]: 7, 25, ['2479', '4833', 'c', 'O', '5651', '7639', 'Z', '4741', 'k', 'T', '6619', 'N', '723', '6619', '303', '4371', '6975', 'f', 'A', '4509', '7885', '4637', '1743', '2667', '3037', '933', 'H', 'U', 'u', 'j']
[A]:
54829