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: 10, 12, ['h', 'C', 'q', '7869', 'S', '2545', '3607', '8257', '165', '6373', 'X', '2481', 'a', '5803', '9191', 'v', 'c', 'k', '8077']
Example Output: 8854

Example Input: 3, 4, ['h', 'w', 'L', 'L']
Example Output: 0

Example Input: 12, 12, ['G', 'P', 'f', 'W', '7331', 'h', '6445', 'P', 'e', 'S', '1891', 'U', 'e', 'A', 't', '9921']
Example Output:
0