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.

Q: 10, 22, ['4049', '2745', 'g', 'T', 'N', 'u', 'Q', '3687', '5871', 'i', '9139', '585', '8435', '5761', '5825', '5909', 'f', '6317', '8227', '4051', 'E', '5167', '6953', 'g', '4113', '2493']

A: 59416
****
Q: 6, 8, ['x', 's', '1415', '6003', '2237', 'g', 'l', 'a', 'l', 'y', 'y', '4651', 'e', 'D', 'g']

A: 0
****
Q: 22, 24, ['y', '6161', 'i', 'd', '9575', 'n', '9807', '8735', '1151', '7185', 'V', 'w', 'Q', 'K', '8091', '1869', 'b', 'H', 'M', '985', 'i', '3109', '2367', '3061']

A:
8537
****