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, 18, ['T', '7117', '7067', 't', '7083', '5711', '6735', 's', '4879', '2553', 'a', 'z', 'Q', '4759', '6243', 'k', 'V', '7803', '2489', 'j', '9449', '8017', '9739', 'F', '1557']

Ex Output:
45766


Ex Input:
7, 15, ['k', '7859', '7463', 'f', 'd', 'L', 'O', 'K', '4629', 'n', 'T', '3785', 'I', 'o', 'Q', '8331', 'U', 'W', '2311', 'u', '5821', '9193']

Ex Output:
8414


Ex Input:
2, 2, ['6187', 'G', 'y']

Ex Output:

0