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]: 11, 16, ['3157', '9479', 'p', '551', '7723', 'I', 'E', 'L', '3983', 'J', '2037', 'q', '4041', 'U', 'n', 's']
[A]: 6078


[Q]: 2, 2, ['M', 'I', 'G', '3747']
[A]: 0


[Q]: 5, 6, ['8013', '5', '4459', '4145', '3021', '7521', 'p', 'D', '9809', 'y', '1435', 'o', '987', 'A']
[A]:
10542