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, ['u', '7053', '303', '329', 'D']
[A]: 7356


[Q]: 7, 18, ['o', '3007', '4747', '869', 'H', '7455', 'U', 'G', '6009', 'H', 'p', '381', '5217', 'q', '1251', 'G', 'i', 'X', '7649', '415', '8053', 'o']
[A]: 12858


[Q]: 9, 20, ['Y', 'a', 'b', '6105', '1181', '4581', 'p', 'w', '5329', '5433', '8237', 'w', '8057', '5885', '1245', '1391', '7157', '1083', '4267', 'i', 'q', '9967', 'K', 'l', '2437', '1841', 'T', 't', '4889']
[A]:
48084