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: 11, 15, ['S', 'F', 'q', 'r', 'X', '2063', '9327', 'R', 'T', 'B', 'j', 'b', 'T', 'X', '3469', 'E', '2177', '8143', 'U', 'Z', '8007', '4991', 'v', 'm', 'f', '7173', 'N', '2449', '2291']

Output: 3469


Input: Consider Input: 2, 3, ['h', 'w', '3397']

Output: 3397


Input: Consider Input: 6, 9, ['l', 'l', '821', 'f', 'h', 'M', '4789', 'c', '8253', '6253', '2273', 'd', 's']


Output: 13042