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:
5, 9, ['9825', '3055', '9869', 'B', 'a', 'W', 'Q', 'k', '4383', 'Q', '8523', 's', 'R', '1481', '5887', '239', 'M', '7121', '6311']

Ex Output:
4383


Ex Input:
5, 14, ['r', '5851', '5957', '1951', '9761', '6805', '2323', 'J', '703', '9479', '6653', 'L', '513', 'A', 'v', '4273', '391', 'b']

Ex Output:
36237


Ex Input:
14, 17, ['k', 'P', '3271', 'n', '4359', '9399', 'x', '2209', 'i', '1167', 'I', 'u', '2937', '8887', '2133', 'c', 'Y', 'U', 'G', '8455', '3695', 'M', 'Y', 'z', '9479', 's', '6931', '171']

Ex Output:

11020