C program to perform symmetric difference on sets

Symmetric difference:- The sets A and B are those elements in A or B, but not in both A and B. While notation varies for the symmetric difference, Symmetric difference is represented by AΔB and is defined by AΔB=(A−B)∪(B−A)
Example: If A={2,4,6,7,9} and B={2,1,7,8,9}, Then, the symmetric diffrence between set A and set B (AΔB) ={1,4,6,8}

// Write a program in c to create two sets and 
// perform  Symmetric operation on sets
#include<stdio.h>
#include<conio.h>
int main()
{
    int a[10],b[10],c[10],d[10],m=0,k=0,n=0,n1,n2,l,i,j,sy[100];
    printf("Enter size of set A:-\n");
    scanf("%d",&n1);
    printf("Enter element of set:-\n");
    for( i=0;i<n1;i++)
    scanf("%d",&a[i]);
    printf("Enter size of set B:-\n");
    scanf("%d",&n2);
    printf("Enter element of set:-\n");
    for( i=0;i<n2;i++)
    scanf("%d",&b[i]);
    // logic for find A-B
    for( i=0;i<n1;i++)
    {
       // here we check that is b[i] already present in the answer set
      // if present then ignore it otherwise add it to the answer set
        for(j=0;j<n2;j++)
        {
            if(b[j]==a[i])
             break;
        }
        if(j==n2)
        {
            for(l=0;l<k;l++)
            {
                if(c[l]==a[i])
                    break;
            }
            if(l==k)
            {
                c[k]=a[i];
                k++;
            }
        }   
    }
    // logic for find B-A
    for( i=0;i<n2;i++)
    {
        for(j=0;j<n1;j++)
        {
            if(b[i]==a[j])
             break;
        }
        if(j==n1)
        {
          // here we check that is b[i] already present in the answer set
          // if present then ignore it otherwise add it to the answer set 
            for(l=0;l<m;l++)
            {
                if(d[l]==b[i])
                 break;
            }
            if(l==m)
            {
                d[m]=b[i];
                m++;
            }
        }
    }
    printf("\n set A is :-\n");
    for(i=0; i<n1;i++)
    {
        printf("%d ", a[i]);
    }
    printf("\n set B is :-\n");
    for(i=0; i<n2;i++)
    {
        printf("%d ", b[i]);
    }
    //logic for symmetric Difference
    
    for(i=0;i<k;i++)
    {
        sy[n]=c[i];
        n++;
    }
    for(i=0;i<m;i++)
    {
        sy[n]=d[i];
        n++;
    }
    printf("\nsymmetric Difference of sets is:-\n");
    for(i=0;i<n;i++)
     printf("%d ",sy[i]);
    getch();   
  }

When the above program is executed, it produces following results --

  
  Enter size of set A:-
  5
  Enter element of set:-
  12
  54
  23
  9
  4
  Enter size of set B:-
  7
  Enter element of set:-
  33
  65
  90
  23
  9
  1
  4
  
   set A is :-
  12 54 23 9 4 
   set B is :-
  33 65 90 23 9 1 4 
  symmetric Difference of sets is:-
  12 54 33 65 90 1