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, 2, ['9797', '5585', '1849', '4485', '9225']
[A]: 5585


[Q]: 11, 16, ['3157', '9479', 'p', '551', '7723', 'I', 'E', 'L', '3983', 'J', '2037', 'q', '4041', 'U', 'n', 's']
[A]: 6078


[Q]: 5, 9, ['3811', 'z', '825', 'c', 'K', 'P', '6371', 'U', '6965', '8361', 'z', 'f', 't', '291', 'G', 'p', 'g', '833', 'a', '7589', '1939']
[A]:
13336