// Definition for singly-linked list.
/* class ListNode {
public int val;
public ListNode next;
ListNode(int x) { val = x; next = null; }
}/
import java.util.;
public class Solution {
ListNode head;
public ListNode solve(ListNode A, int B) {
ListNode k=new ListNode(B);
ListNode curr = head ;
int i=0;
if(head==null)
{
ListNode k1=new ListNode(A-B);
return k1;
}
while(curr.next!=null){
i++;
if(curr.val==B)
break;
else{
curr.val=0;
curr=curr.next;}
}i=i-1;
while(curr.next!=null){
curr.val=B;
curr=curr.next;}
ListNode connection=null;
while(connection!=null)
connection.next=curr.next;
return connection;
}
}