dynamiclist №1 (2task)

#include <iostream>

using namespace std;

struct element
{
    int num;
    element *next;
};

int main()
{
    element *beg, *last, *help, *beg1, *last1, *help1;
    int n,m;
    cin>>n>>m;
    beg = new element;
    cin>>beg -> num;
    last=beg;
    for (int i=2; i<=n;i++){
        help = new element;
        cin>>help -> num;
        last -> next = help;
        last = help;
    }
    last -> next = NULL;
    beg1 = new element;
    cin>>beg1 -> num;
    last1=beg1;
    for (int i=2;i<=m;i++){
        help1 = new element;
        cin>>help1 -> num;
        last1 -> next = help1;
        last1 = help1;
    }
    last1 -> next = NULL;
    help = beg;
    help1 = beg1;
    bool f=1;
    while (help!=0 && help1!=0){
        if (help -> num != help1 -> num)
           {
               f=0;
               break;
           }
           help = help -> next;
           help1 = help1 -> next;
    }
    if (f==1)
    cout<<"YES";
    else
        cout<<"NO";
    return 0;
}
/**
4 4
1 2 3 4
1 2 3 4
**/