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]: 3, 4, ['9567', '9317', 'l', 'n', 'i', '6993', '2775', '2651', '1311', '2955', '6271', 'b', '7333', 'U', 'd', '6455', 'n', 'o', '1871', 'u']
[A]: 0


[Q]: 2, 16, ['e', 'Q', '4017', '1999', '2413', 'v', '4911', 'N', 'x', '3475', '2179', 'o', 'a', '6361', '1723', '6273']
[A]: 33351


[Q]: 2, 17, ['c', 'r', '393', 'i', '705', '4183', '3925', 'N', 'y', 'f', '1083', '1773', '5969', '1913', '5781', 'H', '8037', '7425', 'K', 'N', '8459', 'w', 'j', '6305', 's']
[A]:
33762