Mth to last Element of a Linked List Challenge

Node *findMToLastNode( Node *head, int m){
    Node *cur=head;
    Node *mBehind=NULL;

    int i;
    for (i=0;i<m;i++){
        if (cur->next){
            cur=cur->next;
        }
        else{
            return mBehind;
        }
    }

    mBehind=head;

    while(cur->next){
        cur=cur->next;
        mBehind=mBehind->next;
    }

    return mBehind;
}