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:
10, 12, ['h', 'C', 'q', '7869', 'S', '2545', '3607', '8257', '165', '6373', 'X', '2481', 'a', '5803', '9191', 'v', 'c', 'k', '8077']

Ex Output:
8854


Ex Input:
3, 6, ['w', 'V', '7413', '5027', 's', '7037', 'S', '763', 'D', 'U', 'x', 'l', '9331', 'S', 'k', '8369', 'D', 'A', 'e', 'A', 'r', '5113', '1367', '4197', 'm']

Ex Output:
19477


Ex Input:
26, 28, ['2783', '4283', 'n', '707', '8381', '1563', 'G', '7281', 'j', 'd', '8299', 'a', 'C', 'T', 'K', 'u', '5303', '6703', '2437', 'Q', 'E', '517', '8869', '8401', '2687', 'E', 'f', '8411', 'O']

Ex Output:

8411