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]: 8, 11, ['5059', '2111', 'E', '8681', '5859', '7293', '9627', 'L', 'N', 'n', 'i']
[A]: 0


[Q]: 11, 15, ['S', 'F', 'q', 'r', 'X', '2063', '9327', 'R', 'T', 'B', 'j', 'b', 'T', 'X', '3469', 'E', '2177', '8143', 'U', 'Z', '8007', '4991', 'v', 'm', 'f', '7173', 'N', '2449', '2291']
[A]: 3469


[Q]: 23, 25, ['v', '9483', '1619', '8847', 'S', 'c', 'T', 'T', 'f', 'v', '4405', 'x', 'E', 'U', '9583', 'P', '2739', 'W', 'N', 'd', 'b', '113', 'h', 'Z', '267', '6113']
[A]:
267