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: 1, 3, ['c', '2957', 'u', '2321', 'q', 'P', '2347', 'O', 'P', '4463', 'u']

Output: 2957


Input: Consider Input: 10, 11, ['L', 'Z', '4501', '4131', 'a', '8057', 'K', 'P', '4713', '8889', 'b', '3927', 'k', '6005', 'T', 'w', 'S', '3963', '2727']

Output: 8889


Input: Consider Input: 1, 4, ['2469', 'L', 'F', '4559', 'E', 'D', 'o', '2883', 'i', 'S', 'D', '6579']


Output: 7028