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.
2, 9, ['p', 'y', 'Q', '4475', '4029', '697', 'b', '7841', '351', 'c', '1153', '8591', 'J', '9569', '5253', 'Q', 'm', 'b', 'X', 'o', '195', '379', '4501', '815', 'p', 'i', 'i', '4641']