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.
19, 21, ['3353', '2543', '7373', 'b', '3897', '83', '8149', 'p', '637', 'e', '8311', '6333', '7553', '779', '6839', '665', '7287', 'Z', 'V', 'q', '1']