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, 8, ['R', 'r', '6533', '3469', '3973', '1915', 'p', 't', 'a']
Example Output: 0

Example Input: 2, 6, ['m', 'q', '4069', '4487', 'c', '4639']
Example Output: 13195

Example Input: 23, 29, ['K', 'k', '5075', 't', '8603', 'k', 'B', '1299', 'C', '1381', 'x', '2611', 'o', 'X', '6949', 'y', '7855', 'E', 'E', 'H', 'q', '9875', '3355', 'V', '4969', '9277', 'T', '669', '3077']
Example Output:
21347