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.

Example Input: 6, 13, ['Z', 'h', 'j', 'i', '4335', 'c', 'A', 'O', 'U', '8173', 'N', 'E', '9187', '9911']
Example Output: 17360

Example Input: 19, 21, ['y', '9403', 'C', '389', '5521', '9271', 'W', 'B', '3613', 'w', '2741', 'H', '8305', '727', '7641', '5857', '9183', '1297', 'p', '7371', 'b']
Example Output: 7371

Example Input: 4, 15, ['o', '9961', '8245', '1435', '6361', 'q', 'B', 'V', '7015', 'C', '4269', 'A', '7751', 'q', '7521', '9663', 'f', '1301', '5719', 'u', 'D', '4351', '2231', 'k', 'Q', '9317', '8983', '319', 'q']
Example Output:
34352