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.

Ex Input:
6, 23, ['s', '5425', '7485', 'I', 'r', 'I', '3943', '4067', '3773', '2459', '1525', '2093', '1103', '7373', 'h', 'j', '3209', 'o', 'Q', 'I', '1295', '4569', '4301', 'C', 'N', '269']

Ex Output:
39710


Ex Input:
4, 11, ['4679', 'V', '3421', '8995', '2885', '5395', 'E', '2169', 'i', 'B', '9279', 'G', 'N', 'I', 's', '6827', 'S']

Ex Output:
28723


Ex Input:
8, 10, ['n', 'j', '1739', '9339', '4163', '4317', 'z', '1827', '7019', 'G', '6391', '6091', '4373', 'z', 'A', 'N', '3719', '2897', 'T', '3751', 'd', '1229', '9061', '3117', '6505', '2121', '7583', '1193']

Ex Output:

8846