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: 4, 10, ['C', '6511', 'S', '5389', '5679', 'O', 'Z', 'm', 'p', '1135', '7887', '6407', '6561']
Example Output: 12203

Example Input: 11, 14, ['7277', '3335', 'z', 'R', 's', '8267', 'q', '2743', 'w', '4003', 'G', 'O', 'Y', '4063', 'q', '7001', '7381', 'D', '6247', '7211', 'I', '2277', '7543', 'Y', '8243', '3127', 'V', '8709']
Example Output: 4063

Example Input: 10, 17, ['Q', 'H', 'J', '5403', 'f', 'f', '4489', 'w', '5491', 'F', '1843', 'm', '6997', '1609', '605', '1273', '8023']
Example Output:
20350