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:
1, 2, ['5605', '6415']

Ex Output:
12020


Ex Input:
14, 17, ['Q', '7681', '8379', '2569', 'D', '5179', 'M', 'M', 'k', '187', '9275', 'V', 'L', 'F', '6397', '6385', 'O', '4823', '8655']

Ex Output:
12782


Ex Input:
8, 14, ['N', 'N', 'k', '5745', 'B', 'a', '1007', '2639', 'I', '299', '621', '4937', '6821', 't', '1831', 'Y', '2675', 'A', 'G', '9725']

Ex Output:

15317