C-language implementation of the 3-digit LCM and GCD

The GCD and LCM of 3 numbers are obtained according to the method of LCM and GCD of two numbers.
The main idea is to use a%b==0&a%c==0 to judge whether or not to satisfy, and then use the cycle count.

#include <stdio.h>
int main ()
{
    int x,y,z,tem,i=1,num;
    int k=1;
    printf ("Enter 3: \ n");
    scanf ("%d%d%d", &x,&y,&z);
    tem=x;       Suppose x minimum
    if (tem>y)     //looks for a minimum value of three numbers
    {
        tem=y;
    }
    if (tem>z)
    {
        tem=z;
    }

    for (i=1;i<=tem;i++)   //Set Number of loops
    {
        if (x%i==0&&y%i==0&&z%i==0)  // GCD conditions to meet
        {
            num=i
        }
    }
    while (1)///Forever Set, unconditional loop
    {
        if (k%x==0&k%y==0&k%z==0)  ///judge whether the LCM break
         ;
         else
         k++;
    }
    printf ("Two number of GCD:%d\n", num);
    printf ("Two-digit LCM:%d\n", k);
}

Results test: