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.
--------
Question: 4, 18, ['b', 'K', 'Z', '8757', '691', '8915', 'l', '2819', '9599', '4149', '8791', '7815', '7211', '1973', 'w', '5557', '1071', '2483', '9851', 'x', '5441', '2787', '3723', '5981', 'o', '1045', 'z']

Answer: 69831


Question: 1, 2, ['8895', 't', '5739']

Answer: 8895


Question: 8, 8, ['3161', 'p', 'O', '2517', 'D', 'f', '7029', '7705', '4711', 'F', '189', 'd', 'O', 'q', 'g', '1851', 'O', 'o', '5067', 'u', '2785', 'H']

Answer:
7705