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, 5, ['i', 'e', '6583', '313', '5511']
[A]: 12407


[Q]: 2, 10, ['N', 'K', '4585', 'd', '8219', '3831', 'e', '7037', 'h', 'd', 'c', '577', 'c', '3559', '4059', 'M', '5349', 'V', 'L', '1807']
[A]: 23672


[Q]: 1, 12, ['6541', '3047', '8013', '3695', '9277', 'U', '8781', '3229', 'H', 'F', 'W', '2299', '7035', '1825', '5059']
[A]:
44882