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:
1, 1, ['7479', 'q', 'F', '5725', '7697', '6653', '275', 'l', '7349', 'c']

Ex Output:
7479


Ex Input:
1, 2, ['X', '6095', '5959', '4481', '5997', '3307', 'B']

Ex Output:
6095


Ex Input:
6, 13, ['i', 'V', '6269', '1571', 'X', 'x', '7625', 't', 'I', '4715', '2771', '9707', '6351', '5193', 'n', '4649', '1529', '2377']

Ex Output:

31169