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]: 6, 12, ['q', '8055', '5233', '5529', 'T', 'h', 'w', 'w', '9449', 'W', '7903', 'b', '6925']
[A]: 17352


[Q]: 8, 9, ['1329', '3107', 's', 'z', '2013', '1633', 'i', '1229', '4201', 'M', '3127']
[A]: 5430


[Q]: 16, 23, ['D', 'P', '1309', '7891', '4027', '5273', '8621', '5149', '233', '8357', 'b', '2593', 'n', '8547', 'c', 'D', 't', '253', 'c', 'h', '5443', '2651', '6563', 'K', 'M', '1559']
[A]:
14910