vector<int> v1;

vector<int> v2;

int num1;

int num2;

struct ListNode {

    int val;

    ListNode *next;

    ListNode(int x) : val(x), next(NULL) {}

};

class Solution {

public:

    void insertAtTail(ListNode* &reslist,int val)

    {

        ListNode* p=reslist;

        while (p->next)

            p=p->next;

        ListNode* newNode=(ListNode*)malloc(sizeof(ListNode));

        newNode->val=val;

        newNode->next=p->next;

        p->next=newNode;

    }

    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {

        if(l1==NULL&&l2==NULL) return NULL;

        ListNode* reslist=NULL;

        int jinwei=;

        while(l1!=NULL&&l2!=NULL){

            if((l1->val+l2->val+jinwei)<){

                if(reslist==NULL){

                    reslist=(ListNode*)malloc(sizeof(ListNode));

                    reslist->val=l1->val+l2->val+jinwei;

                    reslist->next=NULL;

                }else{

                    insertAtTail(reslist,l1->val+l2->val+jinwei);

                }

                jinwei=;

            }else{

                if(reslist==NULL){

                    reslist=(ListNode*)malloc(sizeof(ListNode));

                    reslist->val=l1->val+l2->val+jinwei-;

                    reslist->next=NULL;

                }else{

                    insertAtTail(reslist,l1->val+l2->val+jinwei-);

                }

                jinwei=;

            }

            l1=l1->next;

            l2=l2->next;

        }

        while(l1!=NULL){

            if(l1->val+jinwei<){

                insertAtTail(reslist,l1->val+jinwei);

                jinwei=;

            }else{

                insertAtTail(reslist,l1->val+jinwei-);

                jinwei=;

            }

            l1=l1->next;

        }

        while(l2!=NULL){

            if(l2->val+jinwei<){

                insertAtTail(reslist,l2->val+jinwei);

                jinwei=;

            }else{

                insertAtTail(reslist,l2->val+jinwei-);

                jinwei=;

            }

            l2=l2->next;

        }

        if(l1==NULL&&l2==NULL&&jinwei!=){

            insertAtTail(reslist,jinwei);

        }

        return reslist;

    }

};

void CreateListHead(ListNode* &head, int n)

{

    int j=;

    head = (ListNode*)malloc(sizeof(ListNode));

    head->next=NULL;

    head->val=v1[j++];

    ListNode* p=head;

    for (int i=;i<n;++i)

    {

        ListNode* newNode;

        newNode = (ListNode*)malloc(sizeof(ListNode));

        p->next=newNode;

        newNode->next=NULL;

        newNode->val=v1[j++];

        p=p->next;

    }

}

void CreateListHead2(ListNode* &head, int n)

{

    int j=;

    head = (ListNode*)malloc(sizeof(ListNode));

    head->next=NULL;

    head->val=v2[j++];

    ListNode* p=head;

    for (int i=;i<n;++i)

    {

        ListNode* newNode;

        newNode = (ListNode*)malloc(sizeof(ListNode));

        p->next=newNode;

        newNode->next=NULL;

        newNode->val=v2[j++];

        p=p->next;

    }

}

int main()

{

    freopen("C:\\Users\\Administrator\\Desktop\\a.txt","r",stdin);

    cin>>num1;

    for (int i=;i<num1;++i)

    {

        int temp;

        cin>>temp;

        v1.push_back(temp);

    }

    cin>>num2;

    for (int i=;i<num2;++i)

    {

        int temp;

        cin>>temp;

        v2.push_back(temp);

    }

    ListNode* head1=NULL;

    CreateListHead(head1,num1);

    ListNode* head2=NULL;

    CreateListHead2(head2,num2);

    Solution so;

    ListNode* res=so.addTwoNumbers(head1,head2);

    return ;

}