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: 7, 12, ['8785', '221', 'f', 'f', '5743', '4839', '9389', '4759', '1493', 'a', '4951', 'K', '8501', '3331', '2069', '2713', 'j', '7557', 'p', '7679', 'S', '6499', 'E', '439', 't', 'P', 'i', 'u', '8401', 'o']
Example Output: 20592

Example Input: 1, 14, ['n', 'v', '7825', '5951', 'k', '1733', 'c', 'u', 'C', 'c', 'D', 'g', '9231', 'G']
Example Output: 24740

Example Input: 13, 15, ['2387', '8777', 'd', 'Y', '1373', 'f', 'G', '6747', 'R', '1959', 'z', 'o', 'S', '3543', '5175', '1281', '8829', 'n', '3529', 'd', '717', '8303', 'G', '2335', 'i', 'D', 'U', '4189']
Example Output:
8718