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.
11, 12, ['2515', 'd', '6273', '3883', '3783', '3741', '697', 'd', 'e', 'l', 'G', '3653', 'v', 'f', 'M', 'x', '301', 'D', 'j', '7117', 'g', 'T', '4615', '9723', 'X', '3745']