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, 10, ['N', 'K', '4585', 'd', '8219', '3831', 'e', '7037', 'h', 'd', 'c', '577', 'c', '3559', '4059', 'M', '5349', 'V', 'L', '1807']
[A]: 23672


[Q]: 8, 25, ['y', 'r', '639', '6501', '7755', 'A', 'v', 't', '3209', '7899', 'Z', '6099', 'Q', 'L', 'T', 'b', 'P', '6913', 'J', '8855', '551', '4509', '143', '9331', 'c']
[A]: 47509


[Q]: 3, 4, ['8819', 'I', '2387', 'w', '2365']
[A]:
2387