import java.util.*;

public class Solution {
    public ListNode FindKthToTail (ListNode pHead, int k) {
        int n=0;
        ListNode tmp=pHead;
        while(tmp!=null){
            tmp=tmp.next;
            n++;
        }
        if(k>n){
            return null;
        }
        for(int i=1;i<=n-k;i++){
            pHead=pHead.next;
        }
        return pHead;
    }
}