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]: 11, 16, ['3157', '9479', 'p', '551', '7723', 'I', 'E', 'L', '3983', 'J', '2037', 'q', '4041', 'U', 'n', 's']
[EX A]: 6078

[EX Q]: 14, 29, ['1447', 'P', 'X', '5411', '4235', 'K', '6749', '171', '9349', 'K', 'n', '3477', '1183', '9933', '6259', '5793', '1719', 'V', 'C', '1983', '9947', 'I', 'c', '4425', 'Q', 'v', 'a', '3783', '9665', 'z']
[EX A]: 53507

[EX Q]: 7, 14, ['I', '5085', '1623', '7777', 'h', '2759', 'P', 'h', '8851', '3093', '4823', 'X', 'R', 'F', '8221', '6785']
[EX A]:
16767