user: Translate the below assembly code into C programming language:

```asm
<main>:
  endbr64
  push   %r14
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  sub    $0x20,%rsp
  mov    %fs:0x28,%rax
  mov    %rax,0x18(%rsp)
  xor    %eax,%eax
  lea    0xc(%rsp),%rcx
  lea    0x8(%rsp),%rdx
  lea    0x4(%rsp),%rsi
  lea    D21(%rip),%rdi
  call   <scanf@plt>
  mov    0x4(%rsp),%eax
  lea    0x1(%rax),%ebx
  lea    0x0(,%rbx,4),%ebp
  mov    %ebp,%edi
  call   <malloc@plt>
  mov    %rax,%r12
  mov    %ebp,%edx
  mov    $0xffffffff,%esi
  mov    %rax,%rdi
  call   <memset@plt>
  mov    %ebx,%edi
  call   <initializeSet@plt>
  cmpl   $0x0,0x8(%rsp)
  je     L11
  mov    $0x0,%ebx
  lea    D10(%rip),%rbp
  jmp    L14
L40:
  add    $0x1,%ebx
  cmp    %ebx,0x8(%rsp)
  jbe    L11
L14:
  lea    0x14(%rsp),%rdx
  lea    0x10(%rsp),%rsi
  mov    %rbp,%rdi
  mov    $0x0,%eax
  call   <scanf@plt>
  mov    0x10(%rsp),%esi
  mov    0x14(%rsp),%edx
  cmp    %edx,%esi
  je     L40
  mov    %r12,%rdi
  call   <addEdge@plt>
  jmp    L40
L11:
  mov    0xc(%rsp),%eax
  lea    0x0(,%rax,4),%edi
  call   <malloc@plt>
  mov    %rax,%rbp
  mov    0xc(%rsp),%eax
  lea    0x0(,%rax,4),%edi
  call   <malloc@plt>
  mov    %rax,%r13
  cmpl   $0x0,0xc(%rsp)
  je     L65
  mov    $0x0,%ebx
  lea    D35(%rip),%r14
L79:
  mov    %ebx,%eax
  lea    0x0(%rbp,%rax,4),%rsi
  mov    %r14,%rdi
  mov    $0x0,%eax
  call   <scanf@plt>
  add    $0x1,%ebx
  mov    0xc(%rsp),%eax
  cmp    %ebx,%eax
  ja     L79
  test   %eax,%eax
  je     L65
  mov    $0x0,%ebx
L37:
  mov    %ebx,%eax
  lea    0x0(%r13,%rax,4),%r14
  mov    0x0(%rbp,%rax,4),%esi
  mov    %r12,%rdi
  call   <getRootNode@plt>
  mov    %eax,(%r14)
  add    $0x1,%ebx
  cmp    %ebx,0xc(%rsp)
  ja     L37
L65:
  mov    %rbp,%rdi
  call   <free@plt>
  mov    %r12,%rdi
  call   <free@plt>
  mov    0xc(%rsp),%esi
  mov    %r13,%rdi
  call   <getMaxPalindromeLengthOptimised@plt>
  mov    %eax,%ebx
  mov    %r13,%rdi
  call   <free@plt>
  mov    %ebx,%esi
  lea    D6(%rip),%rdi
  call   <printf@plt>
  mov    0x18(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L3
  mov    $0x0,%eax
  add    $0x20,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  ret
L3:
  call   <__stack_chk_fail@plt>
```

tool_calls: name: parse_data
arguments: data_tag: D21
data_type: string
name: parse_data
arguments: data_tag: D10
data_type: string
name: parse_data
arguments: data_tag: D35
data_type: string
name: parse_data
arguments: data_tag: D6
data_type: string

tool: D21: %u%u%u

tool: D10: %u%u

tool: D35: %u

tool: D6: %u


assistant: ```c
int main() {
  unsigned int *arr, *brr, n, k, j, m, i, x, y;
  unsigned int maxPalindromeLength;
  scanf("%u%u%u", &n, &k, &m);
  unsigned int v = n + 1;
  unsigned int *arrLoc = (unsigned int *)malloc(sizeof(unsigned int) * v);
  memset(arrLoc, -1, sizeof(unsigned int) * v);
  initializeSet(v);
  for (j = 0; j < k; j++) {
    scanf("%u%u", &x, &y);
    if (x != y) {
      addEdge(arrLoc, x, y);
    }
  }
  arr = (unsigned int *)malloc(m * sizeof(unsigned int));
  brr = (unsigned int *)malloc(m * sizeof(unsigned int));
  for (i = 0; i < m; i++) {
    scanf("%u", &arr[i]);
  }
  for (i = 0; i < m; i++) {
    brr[i] = getRootNode(arrLoc, arr[i]);
  }
  free(arr);
  free(arrLoc);
  maxPalindromeLength = getMaxPalindromeLengthOptimised(brr, m);
  free(brr);
  printf("%u\n", maxPalindromeLength);
  return 0;
}
```