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, 19, ['5087', 'Q', 'q', '4943', 'Z', '7777', 'Z', 'l', '3303', 'F', 'R', 'c', '8485', 'l', 's', 'Y', '9397', '5413', 'P', 'H', 'J', '6527', 'S', '8877']