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:
6, 15, ['U', 'G', '4461', '7163', '5651', 'x', '4017', 'W', '7237', 'k', 'b', 'k', 'h', '9147', 'T', '9035', '537', 'Y', 'Q']

Ex Output:
20401


Ex Input:
3, 5, ['a', 'q', 'a', '4295', 'z', '675', '3975', 'P', 'e', '4231', '2547', 'V', 'S', '5285', 'Y', 'J']

Ex Output:
4295


Ex Input:
1, 3, ['l', '2741', '1039', 'O', '5459', '9251', '9747', '4137', 'B', 'i', '3211', '5001', 'A', '6353', 'O', 'l', 'g', 'a', 't', 'w', 'H', 'T', '2809', '5877']

Ex Output:

3780