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: 5, 12, ['2653', 'A', '4739', '149', 'J', '817', 'n', '9589', '965', '1545', 'r', '9061', '7973', '5769', 'Y', '5889', 'A', 'P', '5789', '9757']
Example Output: 21977

Example Input: 1, 2, ['4319', '3495']
Example Output: 7814

Example Input: 17, 27, ['f', 'p', '3', '6567', 'C', '4069', 'K', '429', '9681', '4029', 'Y', 's', 'O', 'c', 'U', '9139', '7607', '3227', 'k', 'J', '9653', '501', '6293', 'B', 'R', 'U', '1777', 'O', '7419']
Example Output:
29058