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.
5, 19, ['m', '9007', '1399', '1055', 'd', 'b', 'y', '4803', '5867', '7733', '6049', 'r', '9007', 'S', '3499', '9293', 'q', 'v', '1017', 'V', 'A', '2825', '3307']