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.

[EX Q]: 3, 7, ['k', 'm', 'W', '641', 'X', 'B', '897']
[EX A]: 1538

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

[EX Q]: 1, 4, ['2081', '9125', '4471', 'T', 'g', '9867', '9965', '8361', '7481', '3185', '1257', 'S', 's', 'n', '4349', 'b', 'K', '8275', 'A', 'K', 'V']
[EX A]:
15677