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, 7, ['1505', 'V', '4287', 'M', 'i', 'J', '9343', 'X', '2691', 'W', 'u', '7711', 'X', 'y', '9189']

Output: 13630


Input: Consider Input: 4, 5, ['677', '5585', 'W', 'J', 'C']

Output: 0


Input: Consider Input: 20, 22, ['W', 'V', 'W', '3415', 'P', 'o', 'N', '8445', '3185', 'c', 's', '3133', '9371', '1865', 's', '8277', 'q', '8471', 'b', '4565', '8825', 'H']


Output: 13390