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, 8, ['t', 'N', 'r', '2281', 'u', 'q', 'f', 'F', 'x', '4841', '4601', '8029', 'x', 'Q', 'M', 'L', '5975', 'v', '2913', 'S', 'M', '6429', '4499']
Example Output: 0

Example Input: 1, 2, ['5605', '6415']
Example Output: 12020

Example Input: 2, 16, ['d', '205', '6455', '8103', '7203', 'a', '9995', '3475', '9875', 'c', '3073', '5523', 'K', 'P', '3209', '4901', 'z']
Example Output:
62017