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]: 2, 3, ['9773', 'e', 'G', 'm', '1859']
[EX A]: 0

[EX Q]: 3, 4, ['9567', '9317', 'l', 'n', 'i', '6993', '2775', '2651', '1311', '2955', '6271', 'b', '7333', 'U', 'd', '6455', 'n', 'o', '1871', 'u']
[EX A]: 0

[EX Q]: 2, 7, ['T', 'q', 'p', 'o', '7233', '5977', 'T', 'N', 'K', 'i', 'u', '7699']
[EX A]:
13210