第一题就不会，很难受

#include<stdio.h>
#include<malloc.h>


typedef struct clink
{
clink *next;
int data;
}CLink;





void Create(int m, CLink *&p)
{
p = (CLink *)malloc(sizeof(CLink));


CLink *n, *r;
r = p;
int i, j;
for (i =1; i<=m; i++)
{
n = (CLink *)malloc(sizeof(CLink));
n->data = i;
r->next = n;
r = n;
}
r->next = p->next;
}


void go(int sum,int k, int m, CLink *&p)
{
CLink *n, *r, *s;
r = NULL;
n = p;
int i, j,t;
t = 0;
for (i = 1; i <= k; i++)
{
n = n->next;


}
while (sum > 1)


{
for (i = 1; i <= (m-1); i++)
{
r = n;
n = n->next;
}
printf("%d ", n->data);
r->next = n->next;
free(n);
n = r->next;
t++;
if (t % 10 == 0)
{
printf("\n");
t = t % 10;
}
sum--;
}
printf("%d\n", n->data);
}
int main()


{
CLink *p;
int n, m, k, i;
scanf_s("%d,%d,%d",&n,&k,&m);
if (n < 1 || k < 1 || m < 1)
{
printf("n,m,k must bigger than 0.\n");
}
else if (k > n)
{
printf("k should not bigger than n.\n");
}
else
{
Create(n, p); go(n, k, m, p);
}
return 0;
}