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, 14, ['r', '5851', '5957', '1951', '9761', '6805', '2323', 'J', '703', '9479', '6653', 'L', '513', 'A', 'v', '4273', '391', 'b']

Ex Output:
36237


Ex Input:
4, 6, ['c', 'I', 'O', 'q', 'W', 'w', '7245', '4329', '3833', 'v', 'p', 'V', '5311', 'x', '3971', 't', '8157', '1803']

Ex Output:
0


Ex Input:
4, 9, ['8263', '6767', '8771', 'v', 'H', '9911', '4345', '369', 'r', '7657', '8993', '6099', 'v', 'l', 'M', 'V', '5063', 'j', 'u', 'j', '3721', '591', '5327']

Ex Output:

14625