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: 8, 11, ['5059', '2111', 'E', '8681', '5859', '7293', '9627', 'L', 'N', 'n', 'i']

Output: 0


Input: Consider Input: 1, 6, ['H', '7937', '9919', 'G', 's', '1929', '8585', 'n', 'u', 'J', 'C', '387']

Output: 19785


Input: Consider Input: 6, 8, ['F', '8675', '9655', 'G', '4413', 'N', '9659', '3737', '6741', '9669', '935', '4403']


Output: 13396