**Compilation/Execution Result:**

Given a single linkd list of size **M**, your task is to complete the function **sumOfLastN_Nodes()**, which should return the **sum of last N nodes of the linked list**.

**Input:**

The function takes two arguments as input, the reference pointer to the **head** of the linked list and the an integer **N**.

There will be **T** test cases and for each test case the function will be called seperately.

**Output:**

For each test case output the sum of last N nodes of the linked list.

**Constraints:**

1<=T<=100

1<=N<=M<=1000

**Example:
Input:**

2

6 3

5 9 6 3 4 10

2 2

1 2

17

3

**Note:**The **Input/Ouput** format and **Example** given are used for system's internal purpose, and should be used by a user for **Expected Output** only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

dauntless | 84 |

rksingh | 74 |

iharshitmittal | 74 |

sj5331 | 69 |

madhumitha d rao | 66 |

Shashank_Pathak | 636 |

dark_knights | 560 |

surbhi_7 | 556 |

SANJAY5797 | 359 |

rksingh | 358 |

akhayrutdinov | 4159 |

sanjay05 | 3611 |

Quandray | 2829 |

Ibrahim Nash | 2501 |

Michael Riegger | 2296 |