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:
5, 9, ['9069', 'U', '6879', 'q', '8619', '5335', '8765', '7825', '9621', 'H', '9769', 'E', 'v', '1921']

Ex Output:
40165


Ex Input:
4, 4, ['2107', 'l', '7551', '4907']

Ex Output:
4907


Ex Input:
17, 30, ['3379', 'H', '6649', '8269', 'i', 'l', 'F', 'Q', 'a', 'K', '1465', '7243', '3105', '381', 'X', '3445', 'q', '8851', '4299', '5843', '3929', 'r', '1399', 'l', '107', '4745', 'V', '393', '1103', '7023']

Ex Output:

37692