Define a class, and in the main() method of the class ask the user for an integer input. Based on the input, the method must print out all the prime numbers less than that number.Note: a prime number is one which is only divisible by 1 and itself.

Sure, here is a simple implementation in Java:

import java.util.Scanner;

public class PrimeNumbers {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.println("Enter a number:");
        int num = scanner.nextInt();
        System.out.println("Prime numbers less than " + num + " are: ");
        for (int i = 2; i < num; i++) {
            if (isPrime(i)) {
                System.out.println(i);
            }
        }
    }

    public static boolean isPrime(int num) {
        if (num <= 1) {
            return false;
        }
        for (int i = 2; i < num; i++) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }
}

Here's how it works:

1. We first import the Scanner class which is used to get user input.

2. We define a class named PrimeNumbers.

3. Inside the main() method, we create an object of Scanner class and ask the user to enter a number.

4. We then iterate from 2 to the entered number and for each number, we call the isPrime() method.

5. The isPrime() method checks whether a number is prime or not. It returns false if the number is divisible by any number other than 1 and itself, and true otherwise.

6. If the number is prime, we print it.

This program will print all prime numbers less than the number entered by the user.