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.

Input: Consider Input: 2, 20, ['7991', '1029', 'L', '3307', 'A', '6641', '8833', 'J', '2751', '7457', 'f', '943', 'D', '5609', '5123', '5561', 'N', '1755', '1117', 'C', 'k', '6657', '2569']

Output: 50126


Input: Consider Input: 9, 11, ['6655', 'V', 'm', '3229', '2427', '9165', 'F', 'c', 'K', '3925', '1261', '1055', 'S']

Output: 5186


Input: Consider Input: 2, 16, ['465', '5327', 'm', 'w', '5977', 'w', '7891', 'z', 'C', 'U', '1971', 'N', 'x', '8017', '667', '7791', '6205', 'E', '6581', 'b', 'U', '5279', '3151', '9427']


Output: 37641