UKU0yD - Online Java Compiler & Debugging Tool

import java.io.*;
import java.util.*;

public class Main {
    static final int MAXN = 1_000_000;
    static final long MOD = 1_000_000_007L;
    static int[] spf = new int[MAXN + 1];

    static void computeSPF() {
        for (int i = 2; i <= MAXN; i++) spf[i] = i;
        for (int i = 2; (long) i * i <= MAXN; i++) {
            if (spf[i] == i) {
                for (int j = i * i; j <= MAXN; j += i) {
                    if (spf[j] == j) spf[j] = i;
                }
            }
        }
    }

    static HashMap<Integer, Long> factorMap(long x) {
        HashMap<Integer, Long> map = new HashMap<>();
        while (x > 1) {
            int p = spf[(int) x];
            long cnt = 0;
            while (x % p == 0) {
                x /= p;
                cnt++;
            }
            map.put(p, map.getOrDefault(p, 0L) + cnt);
        }
        return map;
    }

    public static void main(String[] args) throws Exception {
        FastScanner fs = new FastScanner(System.in);
        int n = fs.nextInt();
        int m = fs.nextInt();
        computeSPF();

        HashMap<Integer, Long> base = new HashMap<>();
        for (int i = 2; i <= m; i++) {
            HashMap<Integer, Long> fm = factorMap(i);
            for (Map.Entry<Integer, Long> e : fm.entrySet()) {
                base.put(e.getKey(), base.getOrDefault(e.getKey(), 0L) + e.getValue());
            }
        }

        StringBuilder out = new StringBuilder();
        for (int i = 1; i <= n; i++) {
            long val = fs.nextLong();
            HashMap<Integer, Long> merged = new HashMap<>(base);
            HashMap<Integer, Long> fm = factorMap(val);
            for (Map.Entry<Integer, Long> e : fm.entrySet()) {
                merged.put(e.getKey(), merged.getOrDefault(e.getKey(), 0L) + e.getValue());
            }
            long ans = 1L;
            for (long exp : merged.values()) {
                ans = (ans * ((exp + 1) % MOD)) % MOD;
            }
            out.append(ans).append(i == n ? "\n" : " ");
        }
        System.out.print(out.toString());
    }

    static final class FastScanner {
        private final InputStream in;
        private final byte[] buffer = new byte[1 << 16];
        private int ptr = 0, len = 0;
        FastScanner(InputStream is) { in = is; }
        private int read() throws IOException {
            if (ptr >= len) {
                len = in.read(buffer);
                ptr = 0;
                if (len <= 0) return -1;
            }
            return buffer[ptr++];
        }
        long nextLong() throws IOException {
            int c; while ((c = read()) <= 32) if (c == -1) return Long.MIN_VALUE;
            int sign = 1;
            if (c == '-') { sign = -1; c = read(); }
            long val = 0;
            while (c > 32) { val = val * 10 + (c - '0'); c = read(); }
            return val * sign;
        }
        int nextInt() throws IOException { return (int) nextLong(); }
    }
}