const MOD: usize = 1e9 as usize + 7;

fn power_mat(target: &Vec<Vec<usize>>, times: usize) -> Vec<Vec<usize>> {
    let n = target.len();
    if times == 0 {
        let mut ret = vec![vec![0usize; n]; n];
        for i in 0..n { ret[i][i] = 1; }
        return ret;
    }
    if times == 1 {
        return target.clone();
    }
    let temp = power_mat(target, times/2);
    if times % 2 == 1 {
        calc_mat(&calc_mat(&temp, &temp), target)
    } else {
        calc_mat(&temp, &temp)
    }
}

fn calc_mat(left: &Vec<Vec<usize>>, right: &Vec<Vec<usize>>) -> Vec<Vec<usize>> {
    let sizei = left.len();
    let sizej = right[0].len();
    let sizek = left[0].len();
    let mut ret = vec![vec![0usize; sizej]; sizei];
    for i in 0..sizei {
        for j in 0..sizej {
            ret[i][j] = (0..sizek).map(|k| left[i][k] * right[k][j] % MOD).sum::<usize>() % MOD;
        }
    }
    ret
}

fn main() {
    let mut mk = String::new();
    std::io::stdin().read_line(&mut mk).ok();
    let mk: Vec<usize> = mk.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let m = mk[0];
    let k = mk[1];

    let mut paths = vec![vec![0usize; m]; m];
    for n in 0..m {
        for i in 0..m {
            let nval = (n + i) % m;
            paths[n][nval] += 1;
            let nval = (n * i) % m;
            paths[n][nval] += 1;
        }
    }
    let result = power_mat(&paths, k);
    println!("{}", result[0][0]);
}