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]: 2, 2, ['R', '979', 'H', 'W', 'y']
[A]: 979


[Q]: 2, 7, ['W', 'q', 'w', 'a', '1877', 'u', '5417', 'j', '3993']
[A]:
7294