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.
1, 19, ['S', '5047', 'R', 'j', 'n', '3475', 'l', '1581', '2413', 'n', '2073', '5681', 'x', 'n', 'Y', '8605', '3119', '1365', '7281', '957', '4313']