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, 15, ['q', '3851', '3631', 'z', '6681', 'Z', '461', 'K', 'P', 'i', '9039', '5929', '1415', 'o', 'O', 'H', '4047', 'B', '7073', '2087', 'I', '6857', '5751', '3633', 'U', '869', 'n', 'h', '7807', '469']
[A]: 27156


[Q]: 3, 5, ['i', 'e', '6583', '313', '5511']
[A]: 12407


[Q]: 8, 19, ['K', '5339', '2197', '4587', '1663', '6101', '6387', '19', '1449', '4463', 'd', 'V', 'c', '4537', '9779', 'X', '8759', 'L', '2549', '7101', 'Q', 'U']
[A]:
31555