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]: 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]: 2, 10, ['5659', '2621', 'c', 'v', 'h', 'Q', 'o', 's', 'Q', 'V', 'm', 'x', 'x', 'W', 'x', 't']
[A]:
2621