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:
12, 16, ['J', 'B', '4463', 'b', 'o', '5495', 'S', '7657', 'Y', '4805', 'h', 'f', '9743', 'A', '1167', 'W', 'y', 's', '529', '2899', 't', '5111', '3615', '217', '799', '2761', 'V', '3491', '7621', 'R']

Ex Output:
10910


Ex Input:
1, 3, ['c', '2957', 'u', '2321', 'q', 'P', '2347', 'O', 'P', '4463', 'u']

Ex Output:
2957


Ex Input:
8, 9, ['3587', '5903', 'B', '9671', 's', 'A', '7259', '6961', '2601', '9719']

Ex Output:

9562