#include <stdio.h>
#include <stdlib.h>

struct node {
	int id;
	struct node * next;
};

struct node *start, *ptr, *new_node;

int main() {
	int n, k, m, i, count;
	printf("Enter the number of players: ");
	scanf("%d", &n);
	printf("Enter number k (every k-th player gets eliminated.): ");
	scanf("%d", &k);
	printf("Enter number how many winning players are we going to have: ");
	scanf("%d", &m);

	start = malloc(sizeof(struct node));
	start->id = 1;
	ptr = start;

	// Creating a circular linked list
	for (i=2; i <= n; i++) {
		new_node = malloc(sizeof(struct node));
		ptr->next = new_node;
		new_node->id = i;
		new_node->next = start;
		ptr = new_node;
	}
        // Elimination
	for (count = n; count > m; count--) {
		for (i=0; i<k-1; i++) {
			ptr=ptr->next;
		}

		ptr->next = ptr->next->next;
	}
	// Printing a winning sequence
	int first = ptr->id;
	printf("Id: %d\n", ptr->id);
	ptr = ptr->next;

	while (ptr->id != first) {
		printf("Id: %d\n", ptr->id);
		ptr = ptr->next;
	}
	return 0;
}

// Create a list
struct node *create_list(unsigned long length) {
	struct node *start;
	struct node *new_node, *ptr;
	start = malloc(sizeof(struct node));
	if (start == NULL) {
		printf("Unable to create requested list. Memory allocation error.\n");
		exit(1);
	}
	start->id = 1;
	start->next = start;
	start->remained_next = start;

	ptr = start;

	for (int i = 2; i <= length; i++) {
		new_node = malloc(sizeof(struct node));
		if (new_node == NULL) {
			printf("Unable to create requested list. Memory allocation error.\n");
                        // MEMORY DEALLOCATION CODE?? DO WE NEED IT OR NOT?
			exit(1);
		}
		ptr->next = new_node;
		ptr->remained_next = new_node;
		new_node->id = i;
		new_node->next = start;
		new_node->remained_next = start;
		ptr = new_node;
	}

	return start;
}

struct node {
	int id;
	struct node * next;
};