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: 1, 5, ['t', 'd', 'q', 'T', '1671', '3187', '7659', '8767', '1921', '8653', '5495', 'w', '2243', '5765', '9227', 'G', 'f', 'i', '6591', 'h', 'O', '4503', 'P', 'A', 'U', 'S', 't', 's', '6873']
Example Output: 1671

Example Input: 1, 3, ['Z', 'X', 't']
Example Output: 0

Example Input: 1, 18, ['3509', '4537', 'X', 'S', 'K', '4737', 'G', '7085', '4003', '4265', 'f', 'r', '2753', '4819', 'Y', 'R', 'd', 'Q', 'm', '2575', '4689', '6441', 'M', 'M', 'M', '3749']
Example Output:
35708