The least common multiple of two numbers being JAVA- requirements and minimum divisor

package test01;
import java.util.Scanner;
import java.util.function.IntConsumer;
import java.util.Random;
import javax.swing.text.StyledEditorKit.ForegroundAction;

public class LearnClass {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.println ( "Please enter a positive number:" );
         int m = scanner.nextInt ();
        System.out.println ( "Please enter the second positive number:" );
         int n-= scanner.nextInt ();
         IF (m> n-) {
             for ( int I = n-; I> 0; i--) { // with a relatively small number as the maximum number of conventions down Save 
                IF (m == 0 && n-I% I% == 0 ) {
                    System.out.println ( "Enter your greatest common divisor of two numbers is" + I);
                     BREAK ;
                }
            }
            for ( int I = m; I <n-m *; I ++) { // a relatively large as the largest number of common multiple add up 
                IF (m == 0 && I% I% n-== 0 ) {
                    System.out.println ( "least common multiple of the two numbers you entered is" + I);
                     BREAK ;
                }
            }

        } else {
            for (int i = m; i > 0; i--) {
                if (m % i == 0 && n % i == 0) {
                    System.out.println ( "Enter your greatest common divisor of two numbers is" + I);
                     BREAK ;
                }
            }
            for (int i = n; i < m * n; i++) {
                if (i % m == 0 && i % n == 0) {
                    System.out.println ( "least common multiple of the two numbers you entered is" + I);
                     BREAK ;
                }
            }
        }

    }
}