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]: 2, 3, ['9191', 'D', '1937', 'N', 'g', '3485', '7327']
[A]: 1937


[Q]: 20, 26, ['8183', 'I', 'o', 'B', '7567', '4953', '8133', '2883', 'g', 'D', '865', 'a', 'y', 'Z', 'F', '3211', 'e', 'X', '5135', '7257', 'G', '1577', '7977', 'X', 'z', 'e']
[A]: 16811


[Q]: 3, 8, ['R', 'Z', 'u', 'x', '7621', '2035', 'f', '5401', '8021', '8727']
[A]:
15057