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:
9, 9, ['8073', 'i', '5725', 'j', '4631', 'h', '245', '2191', '2445', '267', 'V', 'D', '3385', 'W']

Ex Output:
2445


Ex Input:
1, 2, ['8895', 't', '5739']

Ex Output:
8895


Ex Input:
2, 5, ['F', 'X', '3247', '667', '9007', '3145', 'u', 'k', '1665', '8373', 's', '6595', 'Q', '6743', 'P', 'I', '2159', 'D', '2127']

Ex Output:

12921