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]: 1, 20, ['N', '3757', '4835', '557', 'n', '3381', '3229', '9715', 'O', 'J', '5215', 'Q', '7867', 'W', '5159', '1571', '2911', '8907', 'J', 'b']
[A]: 57104


[Q]: 8, 12, ['v', 'N', '8123', '1677', '5743', '8657', 'S', '5073', 'Y', 'R', '2781', '6583', 'A', '1989', 'S', '9301', 'y', 'j', '1759', 'U', '9951', 'W', '5967', 'a', 'c']
[A]: 14437


[Q]: 9, 11, ['1409', 'm', '4111', '7109', '6341', '4149', 'D', '5637', '6225', 'c', '3181', 'a', 'V', 'v', 'W', 'F', '6769', '243', '3315']
[A]:
9406