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:
16, 22, ['F', '197', '9799', 'W', '9967', 'V', '9955', '5143', 't', 'f', '749', 'N', 'b', '8049', 'W', '6835', '8007', 'm', '7233', 'B', 'I', '599', '6101', 'G', 'i', '2271', 'h', 'P']

Ex Output:
22674


Ex Input:
5, 8, ['5745', '5919', '2351', 'M', '3273', '6855', '2999', 's', 'F', 'o', 'W', '8607']

Ex Output:
13127


Ex Input:
1, 4, ['3649', 'A', '2003', '367', '3541']

Ex Output:

6019