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: 13, 19, ['5529', 'd', 'W', 'b', 'I', '65', '9995', '6331', '9373', 'V', '8389', 'E', '7455', '105', 'W', 'r', '7733', '7607', 'L', '5553', 'e']

Output: 22900


Input: Consider Input: 13, 14, ['5297', 'V', '7495', '6967', 'b', 'w', 'a', '2403', 'V', 'n', '525', 'd', 'o', 'm', '3439', '4245', '6381', '5743', 'P', '1047']

Output: 0


Input: Consider Input: 4, 13, ['2269', 'G', 'n', '5235', '1169', '5029', 'G', '8199', '2859', 'R', '5693', 'g', 'i', '7471', 'N', 'U', 'K', '3837', '9315', '5909', '9987', 'U', '2385', 'U', '2839', 'G', '2109', '7523', 'U']


Output: 28184