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.
6, 12, ['2199', '3531', '1517', 'f', '7441', '1103', 'H', '5483', 'H', 'Z', '9807', '1047', 'f', 'Y', 'R', 'd', '4671', '5553', '4241', 't', '7353', '3271', 'O', 'R', '7021', '2469']