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.
12, 16, ['1981', '9939', '5227', '2709', 'O', 'X', '59', 'd', '451', '9403', '3561', '7231', 'C', '2861', 'A', '3915', 'X', 'C', 'x', 'z', '9809', '6143', '849', '547', '8855', '4619']