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.

[EX Q]: 5, 6, ['W', '4759', '7861', '321', '5573', 'O', 'N', '157']
[EX A]: 5573

[EX Q]: 5, 8, ['j', '1099', 'J', 'l', 'E', '6559', '6181', '4441']
[EX A]: 17181

[EX Q]: 12, 20, ['8277', 'q', '4249', 'H', 'Z', '6031', '5965', '9035', '927', 'H', '8893', '7865', 'Q', '9571', '1967', 'a', '8699', '7527', '9385', 'W', '7771', '8469']
[EX A]:
45014