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: 8, 25, ['y', 'r', '639', '6501', '7755', 'A', 'v', 't', '3209', '7899', 'Z', '6099', 'Q', 'L', 'T', 'b', 'P', '6913', 'J', '8855', '551', '4509', '143', '9331', 'c']

A: 47509
****
Q: 13, 18, ['3475', 'o', '3353', '3225', 'I', '3297', 'Z', 'i', '7995', '5299', '7275', '3123', '1975', '4599', 's', '2489', '8733', 'N', '4563']

A: 17796
****
Q: 4, 10, ['M', 'P', 'H', '123', 'O', 'l', 'e', 'Z', 'N', '4373', 'a', 'L', 'K', '4375', 'g', 'z', 'B', '2859', 'C', 'd', 'j', '4349', 'Q']

A:
4496
****