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:
3, 4, ['L', 'D', 'T', 'b', 'i', 'X', '7319', '8655', '3183', '1833']

Ex Output:
0


Ex Input:
6, 14, ['707', 'L', '8503', 'x', 'Y', '921', '8415', '6449', '5711', 'd', '591', 'd', '3827', '5569', 'g', 'U', 'v', '7781', 'E', 'z', '4751', '8541', 'c', 'P', '8037', 'X']

Ex Output:
31483


Ex Input:
2, 19, ['6769', 'D', '2779', 'L', '7943', '955', 'l', 'g', '3677', '881', 'n', 'I', 'E', 'F', 'R', 'w', 'h', '6853', 'M', 'j', 'D', 'T', '3041', '5139', '1019', 'h', 'J', 'K']

Ex Output:

23088