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: 7, 12, ['8785', '221', 'f', 'f', '5743', '4839', '9389', '4759', '1493', 'a', '4951', 'K', '8501', '3331', '2069', '2713', 'j', '7557', 'p', '7679', 'S', '6499', 'E', '439', 't', 'P', 'i', 'u', '8401', 'o']

A: 20592
****
Q: 5, 9, ['125', 'A', 'E', 'X', 'j', '319', 'm', '7037', 'g', 'D', 'g', '6737', 'z', '5249']

A: 7356
****
Q: 2, 2, ['6817', '609', 'T', '3971']

A:
609
****