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, 12, ['m', 'f', 'y', '2363', '9555', 'E', 'm', 'J', '1977', 'z', '3733', '9745', 'm', 'u', '1033', 'x', '7351', 'O', 'W', '8311', '955', '8643', 'D', 'e', 'z', 'M', '5139', 'o', 'a']
[A]: 27373


[Q]: 1, 1, ['5141', 'S']
[A]: 5141


[Q]: 5, 17, ['t', 'o', '8725', 'z', '3323', 'I', 'h', 'X', 'U', 'y', 'p', '75', '2727', 'l', 'k', '4779', '6215', 'T', 'T', '6391', '2755', 'i', '6973', '7721', '7371', 'k']
[A]:
17119