Описать структуру с именем MARSH

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
 
struct Route {
  int   id;
  char *begin;
  char *end;
  struct Route *next;
};
 
struct OrderedList {
  struct Route *start;
  size_t size;
};
 
void ClearOrderedList(struct OrderedList *route_list) {
  while (route_list->start != NULL) {
    struct Route *temporary = route_list->start->next;
    free(route_list->start->begin);
    free(route_list->start->end);
    route_list->start = temporary;
    --route_list->size;
  }
}
 
void AddRouteToOrderedList(struct OrderedList *route_list, int route_id,
                           const char *route_begin, const char *route_end) {
  struct Route *new_route = (struct Route*)malloc(sizeof(struct Route));
  new_route->id = route_id;
  new_route->begin = strcpy((char*)malloc(strlen(route_begin) + 1),
                            route_begin);
  new_route->end = strcpy((char*)malloc(strlen(route_end) + 1), route_end);
  new_route->next = NULL;
  if (route_list->start == NULL || route_list->start->id >= new_route->id) {
    new_route->next = route_list->start;
    route_list->start = new_route;
  } else {
    struct Route *previous_route = route_list->start;
    new_route->next = previous_route->next;
    while (new_route->next != NULL && new_route->id > new_route->next->id) {
      previous_route = new_route->next;
      new_route->next = new_route->next->next;
    }
    previous_route->next = new_route;
  }
  ++route_list->size;
}
 
char *NewRandomString(size_t min_size, size_t max_size) {
  size_t size = rand() % (max_size - min_size + 1) + min_size;
  size_t i;
  char *result = (char*)malloc(size + 1);
  result[size] = '\0';
  for (i = 0; i < size; ++i)
    result[i] = rand() % ('z'-'a' + 1) + 'a';
  result[0] += 'A' - 'a';
  return result;
}
 
int main(int argc, char *argv[]) {
  srand(time(NULL));
  struct OrderedList routes = { NULL, 0 };
  size_t i;
  for (i = 0; i < 20; ++i)
    AddRouteToOrderedList(&routes, rand() % 100, NewRandomString(2, 3),
                                                 NewRandomString(2, 3));
  
  struct Route *route = routes.start;
  for (route = routes.start; route != NULL; route = route->next)
      printf("ID: %d, %s -> %s.\n", route->id, route->begin, route->end);
  printf("\n");
 
  size_t buffer_size = 2048;
  char *buffer = (char*)malloc(buffer_size);
  fgets(buffer, buffer_size, stdin);
  buffer[strlen(buffer) - 1] = '\0';
 
  int route_found = 0;
  for (route = routes.start; route != NULL; route = route->next)
    if (strcmp(route->begin, buffer) == 0 ||
        strcmp(route->end, buffer) == 0) {
      printf("ID: %d, %s -> %s.\n", route->id, route->begin, route->end);
      route_found = 1;
    }
 
  if (!route_found)
    printf("No such routes found.\n");
 
  free(buffer);
 
  ClearOrderedList(&routes);
  return 0;
}