// codesnip-guard: main
fn main() {
    #![allow(unused_imports, unused_macros)]
    prepare_io!(_in_buf, scanner, _out);
    macro_rules ! print { ($ ($ arg : tt) *) => (:: std :: write ! (_out , $ ($ arg) *) . expect ("io error")) }
    macro_rules ! println { ($ ($ arg : tt) *) => (:: std :: writeln ! (_out , $ ($ arg) *) . expect ("io error")) }
    scan!(scanner, n, m, s: [{CharsWithBase('a')}; n]);
    let mut t = Trie::new(26);
    let mut deq = std::collections::VecDeque::new();
    deq.push_back((0, 0));
    let mut idx = Indexing::new();
    idx.get((0, 0));
    for s in s.iter() {
        let x = t.insert(s.iter().cloned());
    }
    let mut mp = std::collections::HashMap::<_, M>::new();
    while let Some((u, v)) = deq.pop_front() {
        let i = idx.get((u, v));
        for ch in 0..26 {
            if let (Some(nu), Some(nv)) = (t.next_node(u, ch), t.next_node(v, ch)) {
                let x = minmax!(nu, nv);
                if !idx.contains(&x) {
                    deq.push_back(x);
                }
                *mp.entry((i, idx.get(x))).or_default() += M::one();
                if t.count(nu) > 0 {
                    let x = minmax!(nu, 0);
                    if !idx.contains(&x) {
                        deq.push_back(x);
                    }
                    *mp.entry((i, idx.get(x))).or_default() += M::one();
                }
                if t.count(nv) > 0 {
                    let x = minmax!(0, nv);
                    if !idx.contains(&x) {
                        deq.push_back(x);
                    }
                    *mp.entry((i, idx.get(x))).or_default() += M::one();
                }
                if t.count(nu) > 0 && t.count(nv) > 0 {
                    *mp.entry((i, 0)).or_default() += M::one();
                }
            }
        }
    }
    let k = idx.len();
    let mut mat = vec![vec![M::zero(); k]; k];
    for ((i, j), v) in mp {
        mat[i][j] += v;
    }
    let ans = Matrix::from_vec(mat).pow(m)[0][0];
    println!("{}", ans);
}
#[derive(Debug, Clone)]
pub struct Indexing<T: Eq + std::hash::Hash> {
    map: std::collections::HashMap<T, usize>,
}
impl<T: Eq + std::hash::Hash> Indexing<T> {
    pub fn new() -> Self {
        Self {
            map: Default::default(),
        }
    }
    pub fn len(&self) -> usize {
        self.map.len()
    }
    pub fn contains(&self, key: &T) -> bool {
        self.map.contains_key(key)
    }
    pub fn get(&mut self, key: T) -> usize {
        if let Some(index) = self.map.get(&key) {
            *index
        } else {
            let index = self.map.len();
            self.map.insert(key, index);
            index
        }
    }
}
pub type M = montgomery::MInt998244353;
#[macro_export]
macro_rules! prepare_io {
    ($ in_buf : ident , $ scanner : ident , $ out : ident) => {
        use std::io::{stdout, BufWriter, Write as _};
        let $in_buf = read_stdin_all_unchecked();
        let mut $scanner = Scanner::new(&$in_buf);
        let $out = stdout();
        let mut $out = BufWriter::new($out.lock());
    };
}
// codesnip-guard: _echo
pub fn echo<T: std::fmt::Display>(
    mut writer: impl std::io::Write,
    iter: impl IntoIterator<Item = T>,
    sep: impl std::fmt::Display,
) -> std::io::Result<()> {
    let mut iter = iter.into_iter();
    if let Some(item) = iter.next() {
        write!(writer, "{}", item)?;
    }
    for item in iter {
        write!(writer, "{}{}", sep, item)?;
    }
    writeln!(writer)
}
// codesnip-guard: scanner
pub fn read_stdin_all_unchecked() -> String {
    use std::io::Read as _;
    let mut buf = Vec::new();
    std::io::stdin().read_to_end(&mut buf).expect("io error");
    unsafe { String::from_utf8_unchecked(buf) }
}
pub fn read_stdin_line() -> String {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).expect("io error");
    s
}
pub trait IterScan: Sized {
    type Output;
    fn scan<'a, I: Iterator<Item = &'a str>>(iter: &mut I) -> Option<Self::Output>;
}
pub trait MarkedIterScan: Sized {
    type Output;
    fn mscan<'a, I: Iterator<Item = &'a str>>(self, iter: &mut I) -> Option<Self::Output>;
}
#[derive(Clone, Debug)]
pub struct Scanner<'a> {
    iter: std::str::SplitAsciiWhitespace<'a>,
}
mod scanner_impls {
    use super::*;
    impl<'a> Scanner<'a> {
        #[inline]
        pub fn new(s: &'a str) -> Self {
            let iter = s.split_ascii_whitespace();
            Self { iter }
        }
        #[inline]
        pub fn scan<T: IterScan>(&mut self) -> <T as IterScan>::Output {
            <T as IterScan>::scan(&mut self.iter).expect("scan error")
        }
        #[inline]
        pub fn mscan<T: MarkedIterScan>(&mut self, marker: T) -> <T as MarkedIterScan>::Output {
            marker.mscan(&mut self.iter).expect("scan error")
        }
        #[inline]
        pub fn scan_vec<T: IterScan>(&mut self, size: usize) -> Vec<<T as IterScan>::Output> {
            (0..size)
                .map(|_| <T as IterScan>::scan(&mut self.iter).expect("scan error"))
                .collect()
        }
        #[inline]
        pub fn iter<'b, T: IterScan>(&'b mut self) -> ScannerIter<'a, 'b, T> {
            ScannerIter {
                inner: self,
                _marker: std::marker::PhantomData,
            }
        }
    }
    macro_rules ! iter_scan_impls { ($ ($ t : ty) *) => { $ (impl IterScan for $ t { type Output = Self ; # [inline] fn scan <'a , I : Iterator < Item = &'a str >> (iter : & mut I) -> Option < Self > { iter . next () ?. parse ::<$ t > () . ok () } }) * } ; }
    iter_scan_impls ! (char u8 u16 u32 u64 usize i8 i16 i32 i64 isize f32 f64 u128 i128 String);
    macro_rules ! iter_scan_tuple_impl { ($ ($ T : ident) *) => { impl <$ ($ T : IterScan) ,*> IterScan for ($ ($ T ,) *) { type Output = ($ (<$ T as IterScan >:: Output ,) *) ; # [inline] fn scan <'a , It : Iterator < Item = &'a str >> (_iter : & mut It) -> Option < Self :: Output > { Some (($ (<$ T as IterScan >:: scan (_iter) ?,) *)) } } } ; }
    iter_scan_tuple_impl!();
    iter_scan_tuple_impl!(A);
    iter_scan_tuple_impl ! (A B);
    iter_scan_tuple_impl ! (A B C);
    iter_scan_tuple_impl ! (A B C D);
    iter_scan_tuple_impl ! (A B C D E);
    iter_scan_tuple_impl ! (A B C D E F);
    iter_scan_tuple_impl ! (A B C D E F G);
    iter_scan_tuple_impl ! (A B C D E F G H);
    iter_scan_tuple_impl ! (A B C D E F G H I);
    iter_scan_tuple_impl ! (A B C D E F G H I J);
    iter_scan_tuple_impl ! (A B C D E F G H I J K);
    pub struct ScannerIter<'a, 'b, T> {
        inner: &'b mut Scanner<'a>,
        _marker: std::marker::PhantomData<fn() -> T>,
    }
    impl<'a, 'b, T: IterScan> Iterator for ScannerIter<'a, 'b, T> {
        type Item = <T as IterScan>::Output;
        #[inline]
        fn next(&mut self) -> Option<Self::Item> {
            <T as IterScan>::scan(&mut self.inner.iter)
        }
    }
}
#[derive(Debug, Copy, Clone)]
pub struct Usize1;
#[derive(Debug, Copy, Clone)]
pub struct CharWithBase(pub char);
#[derive(Debug, Copy, Clone)]
pub struct Chars;
#[derive(Debug, Copy, Clone)]
pub struct CharsWithBase(pub char);
#[derive(Debug, Copy, Clone)]
pub struct Collect<T: IterScan, B: std::iter::FromIterator<<T as IterScan>::Output>> {
    size: usize,
    _marker: std::marker::PhantomData<fn() -> (T, B)>,
}
mod marker_impls {
    use super::*;
    use std::{iter::FromIterator, marker::PhantomData};
    impl IterScan for Usize1 {
        type Output = usize;
        #[inline]
        fn scan<'a, I: Iterator<Item = &'a str>>(iter: &mut I) -> Option<Self::Output> {
            <usize as IterScan>::scan(iter)?.checked_sub(1)
        }
    }
    impl MarkedIterScan for CharWithBase {
        type Output = usize;
        #[inline]
        fn mscan<'a, I: Iterator<Item = &'a str>>(self, iter: &mut I) -> Option<Self::Output> {
            Some((<char as IterScan>::scan(iter)? as u8 - self.0 as u8) as usize)
        }
    }
    impl IterScan for Chars {
        type Output = Vec<char>;
        #[inline]
        fn scan<'a, I: Iterator<Item = &'a str>>(iter: &mut I) -> Option<Self::Output> {
            Some(iter.next()?.chars().collect())
        }
    }
    impl MarkedIterScan for CharsWithBase {
        type Output = Vec<usize>;
        #[inline]
        fn mscan<'a, I: Iterator<Item = &'a str>>(self, iter: &mut I) -> Option<Self::Output> {
            Some(
                iter.next()?
                    .chars()
                    .map(|c| (c as u8 - self.0 as u8) as usize)
                    .collect(),
            )
        }
    }
    impl<T: IterScan, B: FromIterator<<T as IterScan>::Output>> Collect<T, B> {
        pub fn new(size: usize) -> Self {
            Self {
                size,
                _marker: PhantomData,
            }
        }
    }
    impl<T: IterScan, B: FromIterator<<T as IterScan>::Output>> MarkedIterScan for Collect<T, B> {
        type Output = B;
        #[inline]
        fn mscan<'a, I: Iterator<Item = &'a str>>(self, iter: &mut I) -> Option<Self::Output> {
            Some(
                (0..self.size)
                    .map(|_| <T as IterScan>::scan(iter).expect("scan error"))
                    .collect::<B>(),
            )
        }
    }
}
#[macro_export]
macro_rules ! scan_value { ($ scanner : expr , ($ ($ t : tt) ,*)) => { ($ ($ crate :: scan_value ! ($ scanner , $ t)) ,*) } ; ($ scanner : expr , [$ t : tt ; $ len : expr]) => { (0 ..$ len) . map (| _ | $ crate :: scan_value ! ($ scanner , $ t)) . collect ::< Vec < _ >> () } ; ($ scanner : expr , [$ t : ty ; $ len : expr]) => { $ scanner . scan_vec ::<$ t > ($ len) } ; ($ scanner : expr , [$ t : ty]) => { $ scanner . iter ::<$ t > () } ; ($ scanner : expr , { $ e : expr }) => { $ scanner . mscan ($ e) } ; ($ scanner : expr , $ t : ty) => { $ scanner . scan ::<$ t > () } ; }
#[macro_export]
macro_rules ! scan { ($ scanner : expr) => { } ; ($ scanner : expr ,) => { } ; ($ scanner : expr , mut $ var : tt : $ t : tt) => { let mut $ var = $ crate :: scan_value ! ($ scanner , $ t) ; } ; ($ scanner : expr , $ var : tt : $ t : tt) => { let $ var = $ crate :: scan_value ! ($ scanner , $ t) ; } ; ($ scanner : expr , mut $ var : tt : $ t : tt , $ ($ rest : tt) *) => { let mut $ var = $ crate :: scan_value ! ($ scanner , $ t) ; scan ! ($ scanner , $ ($ rest) *) } ; ($ scanner : expr , $ var : tt : $ t : tt , $ ($ rest : tt) *) => { let $ var = $ crate :: scan_value ! ($ scanner , $ t) ; scan ! ($ scanner , $ ($ rest) *) } ; ($ scanner : expr , mut $ var : tt) => { let mut $ var = $ crate :: scan_value ! ($ scanner , usize) ; } ; ($ scanner : expr , $ var : tt) => { let $ var = $ crate :: scan_value ! ($ scanner , usize) ; } ; ($ scanner : expr , mut $ var : tt , $ ($ rest : tt) *) => { let mut $ var = $ crate :: scan_value ! ($ scanner , usize) ; scan ! ($ scanner , $ ($ rest) *) } ; ($ scanner : expr , $ var : tt , $ ($ rest : tt) *) => { let $ var = $ crate :: scan_value ! ($ scanner , usize) ; scan ! ($ scanner , $ ($ rest) *) } ; }
// codesnip-guard: Trie
pub struct Trie {
    child: Vec<Vec<usize>>,
    accept: Vec<usize>,
    char_size: usize,
}
impl Trie {
    pub fn new(char_size: usize) -> Self {
        Self {
            child: vec![vec![0; char_size]],
            accept: vec![0],
            char_size,
        }
    }
    pub fn insert_at(
        &mut self,
        mut node: usize,
        iter: impl IntoIterator<Item = usize>,
    ) -> Vec<usize> {
        let mut path = Vec::new();
        for ch in iter.into_iter() {
            path.push(node);
            if self.child[node][ch] == 0 {
                self.child[node][ch] = self.child.len();
                self.child.push(vec![0; self.char_size]);
                self.accept.push(0);
            }
            node = self.child[node][ch];
        }
        path.push(node);
        self.accept[node] += 1;
        path
    }
    pub fn insert(&mut self, iter: impl IntoIterator<Item = usize>) -> Vec<usize> {
        self.insert_at(0, iter)
    }
    pub fn find_at(
        &self,
        mut node: usize,
        iter: impl IntoIterator<Item = usize>,
    ) -> Result<usize, usize> {
        for ch in iter.into_iter() {
            if let Some(v) = self.child.get(node) {
                node = v[ch];
            } else {
                return Err(node);
            }
        }
        Ok(node)
    }
    pub fn find(&self, iter: impl IntoIterator<Item = usize>) -> Result<usize, usize> {
        self.find_at(0, iter)
    }
    pub fn next_node(&self, node: usize, ch: usize) -> Option<usize> {
        if self.child[node][ch] == 0 {
            None
        } else {
            Some(self.child[node][ch])
        }
    }
    pub fn count(&self, node: usize) -> usize {
        self.accept[node]
    }
    pub fn next_count(&self, node: usize, ch: usize) -> usize {
        if let Some(node) = self.next_node(node, ch) {
            self.count(node)
        } else {
            0
        }
    }
}
// codesnip-guard: ord_tools
pub trait PartialOrdExt: Sized {
    fn chmin(&mut self, other: Self);
    fn chmax(&mut self, other: Self);
    fn minmax(self, other: Self) -> (Self, Self);
}
impl<T> PartialOrdExt for T
where
    T: PartialOrd,
{
    #[inline]
    fn chmin(&mut self, other: Self) {
        if *self > other {
            *self = other;
        }
    }
    #[inline]
    fn chmax(&mut self, other: Self) {
        if *self < other {
            *self = other;
        }
    }
    #[inline]
    fn minmax(self, other: Self) -> (Self, Self) {
        if self < other {
            (self, other)
        } else {
            (other, self)
        }
    }
}
#[macro_export]
macro_rules ! min { ($ l : expr) => { $ l } ; ($ l : expr ,) => { $ crate :: min ! ($ l) } ; ($ l : expr , $ r : expr) => { ($ l) . min ($ r) } ; ($ l : expr , $ r : expr ,) => { $ crate :: min ! ($ l , $ r) } ; ($ l : expr , $ r : expr , $ ($ t : tt) *) => { $ crate :: min ! ($ crate :: min ! ($ l , $ r) , $ ($ t) *) } ; }
#[macro_export]
macro_rules ! chmin { ($ l : expr) => { } ; ($ l : expr ,) => { } ; ($ l : expr , $ r : expr) => { { let r = $ r ; if $ l > r { $ l = r ; } } } ; ($ l : expr , $ r : expr ,) => { $ crate :: chmin ! ($ l , $ r) } ; ($ l : expr , $ r : expr , $ ($ t : tt) *) => { $ crate :: chmin ! ($ l , $ r) ; $ crate :: chmin ! ($ l , $ ($ t) *) } ; }
#[macro_export]
macro_rules ! max { ($ l : expr) => { $ l } ; ($ l : expr ,) => { $ crate :: max ! ($ l) } ; ($ l : expr , $ r : expr) => { ($ l) . max ($ r) } ; ($ l : expr , $ r : expr ,) => { $ crate :: max ! ($ l , $ r) } ; ($ l : expr , $ r : expr , $ ($ t : tt) *) => { $ crate :: max ! ($ crate :: max ! ($ l , $ r) , $ ($ t) *) } ; }
#[macro_export]
macro_rules ! chmax { ($ l : expr) => { } ; ($ l : expr ,) => { } ; ($ l : expr , $ r : expr) => { { let r = $ r ; if $ l < r { $ l = r ; } } } ; ($ l : expr , $ r : expr ,) => { $ crate :: chmax ! ($ l , $ r) } ; ($ l : expr , $ r : expr , $ ($ t : tt) *) => { $ crate :: chmax ! ($ l , $ r) ; $ crate :: chmax ! ($ l , $ ($ t) *) } ; }
#[macro_export]
macro_rules ! minmax { ($ ($ t : tt) *) => { ($ crate :: min ! ($ ($ t) *) , $ crate :: max ! ($ ($ t) *)) } ; }
// codesnip-guard: montgomery
pub mod montgomery {
    use super::*;
    pub struct Modulo998244353;
    pub type MInt998244353 = MInt<Modulo998244353>;
    impl<M> MIntBase for M
    where
        M: MontgomeryReduction32,
    {
        type Inner = u32;
        #[inline]
        fn get_mod() -> Self::Inner {
            <Self as MontgomeryReduction32>::get_mod()
        }
        #[inline]
        fn mod_zero() -> Self::Inner {
            0
        }
        #[inline]
        fn mod_one() -> Self::Inner {
            Self::n1()
        }
        #[inline]
        fn mod_add(x: Self::Inner, y: Self::Inner) -> Self::Inner {
            let z = x + y;
            let m = Self::get_mod();
            if z >= m {
                z - m
            } else {
                z
            }
        }
        #[inline]
        fn mod_sub(x: Self::Inner, y: Self::Inner) -> Self::Inner {
            if x < y {
                x + Self::get_mod() - y
            } else {
                x - y
            }
        }
        #[inline]
        fn mod_mul(x: Self::Inner, y: Self::Inner) -> Self::Inner {
            Self::reduce(x as u64 * y as u64)
        }
        #[inline]
        fn mod_div(x: Self::Inner, y: Self::Inner) -> Self::Inner {
            Self::mod_mul(x, Self::mod_inv(y))
        }
        #[inline]
        fn mod_neg(x: Self::Inner) -> Self::Inner {
            if x == 0 {
                0
            } else {
                Self::get_mod() - x
            }
        }
        fn mod_inv(x: Self::Inner) -> Self::Inner {
            let mut a = x;
            let m = Self::get_mod();
            let (mut b, mut u, mut s) = (m, 1, 0);
            let k = a.trailing_zeros();
            a >>= k;
            for _ in 0..k {
                if u & 1 == 1 {
                    u += m;
                }
                u /= 2;
            }
            while a != b {
                if b < a {
                    std::mem::swap(&mut a, &mut b);
                    std::mem::swap(&mut u, &mut s);
                }
                b -= a;
                if s < u {
                    s += m;
                }
                s -= u;
                let k = b.trailing_zeros();
                b >>= k;
                for _ in 0..k {
                    if s & 1 == 1 {
                        s += m;
                    }
                    s /= 2;
                }
            }
            Self::reduce(s as u64 * Self::n3() as u64)
        }
    }
    impl<M> MIntConvert<u32> for M
    where
        M: MontgomeryReduction32,
    {
        #[inline]
        fn from(x: u32) -> Self::Inner {
            Self::reduce(x as u64 * Self::n2() as u64)
        }
        #[inline]
        fn into(x: Self::Inner) -> u32 {
            Self::reduce(x as u64) as u32
        }
        #[inline]
        fn mod_into() -> u32 {
            <Self as MIntBase>::get_mod() as u32
        }
    }
    impl<M> MIntConvert<u64> for M
    where
        M: MontgomeryReduction32,
    {
        #[inline]
        fn from(x: u64) -> Self::Inner {
            Self::reduce(x % Self::get_mod() as u64 * Self::n2() as u64)
        }
        #[inline]
        fn into(x: Self::Inner) -> u64 {
            Self::reduce(x as u64) as u64
        }
        #[inline]
        fn mod_into() -> u64 {
            <Self as MIntBase>::get_mod() as u64
        }
    }
    impl<M> MIntConvert<usize> for M
    where
        M: MontgomeryReduction32,
    {
        #[inline]
        fn from(x: usize) -> Self::Inner {
            Self::reduce(x as u64 % Self::get_mod() as u64 * Self::n2() as u64)
        }
        #[inline]
        fn into(x: Self::Inner) -> usize {
            Self::reduce(x as u64) as usize
        }
        #[inline]
        fn mod_into() -> usize {
            <Self as MIntBase>::get_mod() as usize
        }
    }
    impl MIntConvert<i32> for Modulo998244353 {
        #[inline]
        fn from(x: i32) -> Self::Inner {
            let x = x % <Self as MIntBase>::get_mod() as i32;
            let x = if x < 0 {
                (x + <Self as MIntBase>::get_mod() as i32) as u64
            } else {
                x as u64
            };
            Self::reduce(x as u64 * Self::n2() as u64)
        }
        #[inline]
        fn into(x: Self::Inner) -> i32 {
            Self::reduce(x as u64) as i32
        }
        #[inline]
        fn mod_into() -> i32 {
            <Self as MIntBase>::get_mod() as i32
        }
    }
    impl MIntConvert<i64> for Modulo998244353 {
        #[inline]
        fn from(x: i64) -> Self::Inner {
            let x = x % <Self as MIntBase>::get_mod() as i64;
            let x = if x < 0 {
                (x + <Self as MIntBase>::get_mod() as i64) as u64
            } else {
                x as u64
            };
            Self::reduce(x as u64 * Self::n2() as u64)
        }
        #[inline]
        fn into(x: Self::Inner) -> i64 {
            Self::reduce(x as u64) as i64
        }
        #[inline]
        fn mod_into() -> i64 {
            <Self as MIntBase>::get_mod() as i64
        }
    }
    impl MIntConvert<isize> for Modulo998244353 {
        #[inline]
        fn from(x: isize) -> Self::Inner {
            let x = x % <Self as MIntBase>::get_mod() as isize;
            let x = if x < 0 {
                (x + <Self as MIntBase>::get_mod() as isize) as u64
            } else {
                x as u64
            };
            Self::reduce(x as u64 * Self::n2() as u64)
        }
        #[inline]
        fn into(x: Self::Inner) -> isize {
            Self::reduce(x as u64) as isize
        }
        #[inline]
        fn mod_into() -> isize {
            <Self as MIntBase>::get_mod() as isize
        }
    }
    /// m is prime, n = 2^32
    pub trait MontgomeryReduction32 {
        /// m
        fn get_mod() -> u32;
        /// (-m)^{-1} mod n
        fn r() -> u32 {
            let m = Self::get_mod();
            let mut r = 0;
            let mut t = 0;
            for i in 0..32 {
                if t % 2 == 0 {
                    t += m;
                    r += 1 << i;
                }
                t /= 2;
            }
            r
        }
        /// n^1 mod m
        fn n1() -> u32;
        /// n^2 mod m
        fn n2() -> u32;
        /// n^3 mod m
        fn n3() -> u32;
        /// n^{-1}x = (x + (xr mod n)m) / n
        fn reduce(x: u64) -> u32 {
            let m: u32 = Self::get_mod();
            let r = Self::r();
            let mut x = ((x + r.wrapping_mul(x as u32) as u64 * m as u64) >> 32) as u32;
            if x >= m {
                x -= m;
            }
            x
        }
    }
    macro_rules! impl_montgomery_reduction_32 {
        ($ name : ident , $ m : expr , $ r : expr , $ n1 : expr , $ n2 : expr , $ n3 : expr) => {
            impl MontgomeryReduction32 for $name {
                #[inline]
                fn get_mod() -> u32 {
                    $m
                }
                #[inline]
                fn r() -> u32 {
                    $r
                }
                #[inline]
                fn n1() -> u32 {
                    $n1
                }
                #[inline]
                fn n2() -> u32 {
                    $n2
                }
                #[inline]
                fn n3() -> u32 {
                    $n3
                }
            }
        };
    }
    impl_montgomery_reduction_32!(
        Modulo998244353,
        998_244_353,
        998_244_351,
        301_989_884,
        932_051_910,
        679_058_953
    );
}
// codesnip-guard: MIntBase
#[repr(transparent)]
pub struct MInt<M>
where
    M: MIntBase,
{
    x: M::Inner,
    _marker: std::marker::PhantomData<fn() -> M>,
}
pub trait MIntBase {
    type Inner: Sized + Copy + Eq + std::fmt::Debug + std::hash::Hash;
    fn get_mod() -> Self::Inner;
    fn mod_zero() -> Self::Inner;
    fn mod_one() -> Self::Inner;
    fn mod_add(x: Self::Inner, y: Self::Inner) -> Self::Inner;
    fn mod_sub(x: Self::Inner, y: Self::Inner) -> Self::Inner;
    fn mod_mul(x: Self::Inner, y: Self::Inner) -> Self::Inner;
    fn mod_div(x: Self::Inner, y: Self::Inner) -> Self::Inner;
    fn mod_neg(x: Self::Inner) -> Self::Inner;
    fn mod_inv(x: Self::Inner) -> Self::Inner;
    fn mod_pow(x: Self::Inner, y: usize) -> Self::Inner {
        let (mut x, mut y, mut z) = (x, y, Self::mod_one());
        while y > 0 {
            if y & 1 == 1 {
                z = Self::mod_mul(z, x);
            }
            x = Self::mod_mul(x, x);
            y >>= 1;
        }
        z
    }
}
pub trait MIntConvert<T = <Self as MIntBase>::Inner>: MIntBase {
    fn from(x: T) -> <Self as MIntBase>::Inner;
    fn into(x: <Self as MIntBase>::Inner) -> T;
    fn mod_into() -> T;
}
mod mint_base {
    use super::*;
    use std::{
        fmt::{self, Debug, Display},
        hash::{Hash, Hasher},
        iter::{Product, Sum},
        marker::PhantomData,
        ops::{Add, AddAssign, Div, DivAssign, Mul, MulAssign, Neg, Sub, SubAssign},
        str::FromStr,
    };
    impl<M> MInt<M>
    where
        M: MIntConvert,
    {
        #[inline]
        pub fn new(x: M::Inner) -> Self {
            Self::new_unchecked(<M as MIntConvert<M::Inner>>::from(x))
        }
        #[inline]
        pub fn inner(self) -> M::Inner {
            <M as MIntConvert<M::Inner>>::into(self.x)
        }
    }
    impl<M> MInt<M>
    where
        M: MIntBase,
    {
        #[inline]
        pub fn new_unchecked(x: M::Inner) -> Self {
            Self {
                x,
                _marker: PhantomData,
            }
        }
        #[inline]
        pub fn get_mod() -> M::Inner {
            M::get_mod()
        }
        #[inline]
        pub fn pow(self, y: usize) -> Self {
            Self::new_unchecked(M::mod_pow(self.x, y))
        }
        #[inline]
        pub fn inv(self) -> Self {
            Self::new_unchecked(M::mod_inv(self.x))
        }
    }
    impl<M> Clone for MInt<M>
    where
        M: MIntBase,
    {
        #[inline]
        fn clone(&self) -> Self {
            Self {
                x: Clone::clone(&self.x),
                _marker: PhantomData,
            }
        }
    }
    impl<M> Copy for MInt<M> where M: MIntBase {}
    impl<M> Debug for MInt<M>
    where
        M: MIntBase,
    {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            Debug::fmt(&self.x, f)
        }
    }
    impl<M> Default for MInt<M>
    where
        M: MIntBase,
    {
        #[inline]
        fn default() -> Self {
            <Self as Zero>::zero()
        }
    }
    impl<M> PartialEq for MInt<M>
    where
        M: MIntBase,
    {
        #[inline]
        fn eq(&self, other: &Self) -> bool {
            PartialEq::eq(&self.x, &other.x)
        }
    }
    impl<M> Eq for MInt<M> where M: MIntBase {}
    impl<M> Hash for MInt<M>
    where
        M: MIntBase,
    {
        #[inline]
        fn hash<H: Hasher>(&self, state: &mut H) {
            Hash::hash(&self.x, state)
        }
    }
    macro_rules ! impl_mint_from { ($ ($ t : ty) ,*) => { $ (impl < M > From <$ t > for MInt < M > where M : MIntConvert <$ t >, { # [inline] fn from (x : $ t) -> Self { Self :: new_unchecked (< M as MIntConvert <$ t >>:: from (x)) } } impl < M > From < MInt < M >> for $ t where M : MIntConvert <$ t >, { # [inline] fn from (x : MInt < M >) -> $ t { < M as MIntConvert <$ t >>:: into (x . x) } }) * } ; }
    impl_mint_from!(u8, u16, u32, u64, u128, usize, i8, i16, i32, i64, i128, isize);
    impl<M> Zero for MInt<M>
    where
        M: MIntBase,
    {
        #[inline]
        fn zero() -> Self {
            Self::new_unchecked(M::mod_zero())
        }
    }
    impl<M> One for MInt<M>
    where
        M: MIntBase,
    {
        #[inline]
        fn one() -> Self {
            Self::new_unchecked(M::mod_one())
        }
    }
    impl<M> Add for MInt<M>
    where
        M: MIntBase,
    {
        type Output = Self;
        #[inline]
        fn add(self, rhs: Self) -> Self::Output {
            Self::new_unchecked(M::mod_add(self.x, rhs.x))
        }
    }
    impl<M> Sub for MInt<M>
    where
        M: MIntBase,
    {
        type Output = Self;
        #[inline]
        fn sub(self, rhs: Self) -> Self::Output {
            Self::new_unchecked(M::mod_sub(self.x, rhs.x))
        }
    }
    impl<M> Mul for MInt<M>
    where
        M: MIntBase,
    {
        type Output = Self;
        #[inline]
        fn mul(self, rhs: Self) -> Self::Output {
            Self::new_unchecked(M::mod_mul(self.x, rhs.x))
        }
    }
    impl<M> Div for MInt<M>
    where
        M: MIntBase,
    {
        type Output = Self;
        #[inline]
        fn div(self, rhs: Self) -> Self::Output {
            Self::new_unchecked(M::mod_div(self.x, rhs.x))
        }
    }
    impl<M> Neg for MInt<M>
    where
        M: MIntBase,
    {
        type Output = Self;
        #[inline]
        fn neg(self) -> Self::Output {
            Self::new_unchecked(M::mod_neg(self.x))
        }
    }
    impl<M> Sum for MInt<M>
    where
        M: MIntBase,
    {
        #[inline]
        fn sum<I: Iterator<Item = Self>>(iter: I) -> Self {
            iter.fold(<Self as Zero>::zero(), Add::add)
        }
    }
    impl<M> Product for MInt<M>
    where
        M: MIntBase,
    {
        #[inline]
        fn product<I: Iterator<Item = Self>>(iter: I) -> Self {
            iter.fold(<Self as One>::one(), Mul::mul)
        }
    }
    impl<'a, M: 'a> Sum<&'a MInt<M>> for MInt<M>
    where
        M: MIntBase,
    {
        #[inline]
        fn sum<I: Iterator<Item = &'a Self>>(iter: I) -> Self {
            iter.fold(<Self as Zero>::zero(), Add::add)
        }
    }
    impl<'a, M: 'a> Product<&'a MInt<M>> for MInt<M>
    where
        M: MIntBase,
    {
        #[inline]
        fn product<I: Iterator<Item = &'a Self>>(iter: I) -> Self {
            iter.fold(<Self as One>::one(), Mul::mul)
        }
    }
    impl<M> Display for MInt<M>
    where
        M: MIntConvert,
        M::Inner: Display,
    {
        fn fmt<'a>(&self, f: &mut fmt::Formatter<'a>) -> Result<(), fmt::Error> {
            write!(f, "{}", self.inner())
        }
    }
    impl<M> FromStr for MInt<M>
    where
        M: MIntConvert,
        M::Inner: FromStr,
    {
        type Err = <M::Inner as FromStr>::Err;
        #[inline]
        fn from_str(s: &str) -> Result<Self, Self::Err> {
            s.parse::<M::Inner>().map(Self::new)
        }
    }
    impl<M> IterScan for MInt<M>
    where
        M: MIntConvert,
        M::Inner: FromStr,
    {
        type Output = Self;
        #[inline]
        fn scan<'a, I: Iterator<Item = &'a str>>(iter: &mut I) -> Option<Self::Output> {
            iter.next()?.parse::<MInt<M>>().ok()
        }
    }
    macro_rules! impl_mint_ref_binop {
        ($ imp : ident , $ method : ident , $ t : ty) => {
            impl<M> $imp<$t> for &$t
            where
                M: MIntBase,
            {
                type Output = <$t as $imp<$t>>::Output;
                #[inline]
                fn $method(self, other: $t) -> <$t as $imp<$t>>::Output {
                    $imp::$method(*self, other)
                }
            }
            impl<M> $imp<&$t> for $t
            where
                M: MIntBase,
            {
                type Output = <$t as $imp<$t>>::Output;
                #[inline]
                fn $method(self, other: &$t) -> <$t as $imp<$t>>::Output {
                    $imp::$method(self, *other)
                }
            }
            impl<M> $imp<&$t> for &$t
            where
                M: MIntBase,
            {
                type Output = <$t as $imp<$t>>::Output;
                #[inline]
                fn $method(self, other: &$t) -> <$t as $imp<$t>>::Output {
                    $imp::$method(*self, *other)
                }
            }
        };
    }
    impl_mint_ref_binop!(Add, add, MInt<M>);
    impl_mint_ref_binop!(Sub, sub, MInt<M>);
    impl_mint_ref_binop!(Mul, mul, MInt<M>);
    impl_mint_ref_binop!(Div, div, MInt<M>);
    macro_rules! impl_mint_ref_unop {
        ($ imp : ident , $ method : ident , $ t : ty) => {
            impl<M> $imp for &$t
            where
                M: MIntBase,
            {
                type Output = <$t as $imp>::Output;
                #[inline]
                fn $method(self) -> <$t as $imp>::Output {
                    $imp::$method(*self)
                }
            }
        };
    }
    impl_mint_ref_unop!(Neg, neg, MInt<M>);
    macro_rules! impl_mint_ref_op_assign {
        ($ imp : ident , $ method : ident , $ t : ty , $ fromimp : ident , $ frommethod : ident) => {
            impl<M> $imp<$t> for $t
            where
                M: MIntBase,
            {
                #[inline]
                fn $method(&mut self, rhs: $t) {
                    *self = $fromimp::$frommethod(*self, rhs);
                }
            }
            impl<M> $imp<&$t> for $t
            where
                M: MIntBase,
            {
                #[inline]
                fn $method(&mut self, other: &$t) {
                    $imp::$method(self, *other);
                }
            }
        };
    }
    impl_mint_ref_op_assign!(AddAssign, add_assign, MInt<M>, Add, add);
    impl_mint_ref_op_assign!(SubAssign, sub_assign, MInt<M>, Sub, sub);
    impl_mint_ref_op_assign!(MulAssign, mul_assign, MInt<M>, Mul, mul);
    impl_mint_ref_op_assign!(DivAssign, div_assign, MInt<M>, Div, div);
}
// codesnip-guard: zero_one
pub trait Zero: PartialEq + Sized {
    fn zero() -> Self;
    #[inline]
    fn is_zero(&self) -> bool {
        self == &Self::zero()
    }
}
pub trait One: PartialEq + Sized {
    fn one() -> Self;
    #[inline]
    fn is_one(&self) -> bool {
        self == &Self::one()
    }
}
macro_rules ! zero_one_impls { ($ ({ $ Trait : ident $ method : ident $ ($ t : ty) *, $ e : expr }) *) => { $ ($ (impl $ Trait for $ t { # [inline] fn $ method () -> Self { $ e } }) *) * } ; }
zero_one_impls ! ({ Zero zero u8 u16 u32 u64 usize i8 i16 i32 i64 isize u128 i128 , 0 } { Zero zero f32 f64 , 0. } { One one u8 u16 u32 u64 usize i8 i16 i32 i64 isize u128 i128 , 1 } { One one f32 f64 , 1. });
// codesnip-guard: Matrix
#[derive(Clone, Debug, PartialEq, Eq)]
pub struct Matrix<T> {
    pub shape: (usize, usize),
    pub data: Vec<Vec<T>>,
}
mod matrix_impls {
    use super::*;
    use std::ops::{Add, Div, Index, IndexMut, Mul, Sub};
    impl<T: Clone> Matrix<T> {
        pub fn new(shape: (usize, usize), z: T) -> Self {
            Self {
                shape,
                data: vec![vec![z; shape.1]; shape.0],
            }
        }
    }
    impl<T> Matrix<T> {
        pub fn from_vec(data: Vec<Vec<T>>) -> Self {
            Self {
                shape: (data.len(), data.first().map(Vec::len).unwrap_or_default()),
                data,
            }
        }
    }
    impl<T: Clone + Zero> Matrix<T> {
        pub fn zeros(shape: (usize, usize)) -> Self {
            Self {
                shape,
                data: vec![vec![Zero::zero(); shape.1]; shape.0],
            }
        }
    }
    impl<T: Clone + Zero + One> Matrix<T> {
        pub fn eye(shape: (usize, usize)) -> Self {
            let mut data = vec![vec![Zero::zero(); shape.1]; shape.0];
            for (i, d) in data.iter_mut().enumerate() {
                d[i] = One::one();
            }
            Self { shape, data }
        }
    }
    impl<T> Index<usize> for Matrix<T> {
        type Output = Vec<T>;
        fn index(&self, index: usize) -> &Self::Output {
            &self.data[index]
        }
    }
    impl<T> IndexMut<usize> for Matrix<T> {
        fn index_mut(&mut self, index: usize) -> &mut Self::Output {
            &mut self.data[index]
        }
    }
    impl<T> Index<(usize, usize)> for Matrix<T> {
        type Output = T;
        fn index(&self, index: (usize, usize)) -> &Self::Output {
            &self.data[index.0][index.1]
        }
    }
    impl<T> IndexMut<(usize, usize)> for Matrix<T> {
        fn index_mut(&mut self, index: (usize, usize)) -> &mut Self::Output {
            &mut self.data[index.0][index.1]
        }
    }
    impl<'a, T: Copy + Zero + Add<Output = T>> Add for &'a Matrix<T> {
        type Output = Matrix<T>;
        fn add(self, rhs: Self) -> Self::Output {
            assert_eq!(self.shape, rhs.shape);
            let mut res = Matrix::zeros(self.shape);
            for i in 0..self.shape.0 {
                for j in 0..self.shape.1 {
                    res[i][j] = self[i][j] + rhs[i][j];
                }
            }
            res
        }
    }
    impl<'a, T: Copy + Zero + Sub<Output = T>> Sub for &'a Matrix<T> {
        type Output = Matrix<T>;
        fn sub(self, rhs: Self) -> Self::Output {
            assert_eq!(self.shape, rhs.shape);
            let mut res = Matrix::zeros(self.shape);
            for i in 0..self.shape.0 {
                for j in 0..self.shape.1 {
                    res[i][j] = self[i][j] - rhs[i][j];
                }
            }
            res
        }
    }
    impl<'a, T: Copy + Zero + Add<Output = T> + Mul<Output = T>> Mul for &'a Matrix<T> {
        type Output = Matrix<T>;
        fn mul(self, rhs: Self) -> Self::Output {
            assert_eq!(self.shape.1, rhs.shape.0);
            let mut res = Matrix::zeros((self.shape.0, rhs.shape.1));
            for i in 0..self.shape.0 {
                for j in 0..rhs.shape.1 {
                    for k in 0..self.shape.1 {
                        res[i][j] = res[i][j] + self[i][k] * rhs[k][j];
                    }
                }
            }
            res
        }
    }
    impl<T: Copy + Zero + One + Add<Output = T> + Mul<Output = T>> Matrix<T> {
        pub fn pow(&self, mut n: usize) -> Self {
            assert_eq!(self.shape.0, self.shape.1);
            let mut x = self.clone();
            let mut res = Matrix::eye(self.shape);
            while n > 0 {
                if n & 1 == 1 {
                    res = &res * &x;
                }
                x = &x * &x;
                n >>= 1;
            }
            res
        }
    }
    impl<T: Copy + Zero + One + Sub<Output = T> + Mul<Output = T> + Div<Output = T>> Matrix<T> {
        pub fn row_reduction(&mut self) {
            let (n, m) = self.shape;
            let mut c = 0;
            for r in 0..n {
                loop {
                    if c >= m {
                        return;
                    }
                    if let Some(pivot) = (r..n).find(|&p| !self[p][c].is_zero()) {
                        self.data.swap(r, pivot);
                        break;
                    };
                    c += 1;
                }
                let d = T::one() / self[r][c];
                for j in c..m {
                    self[r][j] = self[r][j] * d;
                }
                for i in (0..n).filter(|&i| i != r) {
                    let d = self[i][c];
                    for j in c..m {
                        self[i][j] = self[i][j] - d * self[r][j];
                    }
                }
                c += 1;
            }
        }
        pub fn rank(&mut self) -> usize {
            let n = self.shape.0;
            self.row_reduction();
            (0..n)
                .filter(|&i| !self.data[i].iter().all(|x| x.is_zero()))
                .count()
        }
        pub fn solve_system_of_linear_equations(&self, b: &[T]) -> Option<Vec<T>> {
            assert_eq!(self.shape.0, self.shape.1);
            assert_eq!(self.shape.0, b.len());
            let n = self.shape.0;
            let mut c = Matrix::<T>::zeros((n, n + 1));
            for i in 0..n {
                c[i][..n].clone_from_slice(&self[i]);
                c[i][n] = b[i];
            }
            c.row_reduction();
            if (0..n).any(|i| c[i][i].is_zero()) {
                None
            } else {
                Some((0..n).map(|i| c[i][n]).collect::<Vec<_>>())
            }
        }
        pub fn inverse(&self) -> Option<Matrix<T>> {
            assert_eq!(self.shape.0, self.shape.1);
            let n = self.shape.0;
            let mut c = Matrix::<T>::zeros((n, n * 2));
            for i in 0..n {
                c[i][..n].clone_from_slice(&self[i]);
                c[i][n + i] = T::one();
            }
            c.row_reduction();
            if (0..n).any(|i| c[i][i].is_zero()) {
                None
            } else {
                Some(Self::from_vec(
                    c.data.into_iter().map(|r| r[n..].to_vec()).collect(),
                ))
            }
        }
    }
}


//spnauti-rusT {{{
#[allow(unused_imports)]use std::{io::*,collections::*,fmt::Debug,str::{self,*},cmp::*,ops::{self,*},iter::{self,*}};
macro_rules!v{
	($(:$t:ty)?=$e:expr)=>{$e$(as$t)?};([$d:expr]$(:$t:ty)?)=>{Vec::$(<$t>::)?with_capacity($d)};
	([]$(:$t:ty)?)=>{Vec::$(<$t>::)?new()};([$d:expr]$($s:tt)+)=>{vec![v!($($s)+);$d]};}
fn rio()->(Reader,BufWriter<Stdout>){(Reader::new(),BufWriter::new(stdout()))}
struct Reader{buf:Vec<u8>,pos:usize,x:*mut Stdin,q:StdinLock<'static>}//'
#[allow(dead_code)]impl Reader{
	fn new()->Self{let x=Box::into_raw(Box::new(stdin()));let q=unsafe{&*x}.lock();Self{x,q,buf:v!([]),pos:0}}
	fn next_line(&mut self)->bool{self.buf.clear();self.pos=0;self.q.read_until(b'\n',&mut self.buf).unwrap_or(0)>0}
	fn byte(&mut self)->Option<u8>{
		if self.pos==self.buf.len(){if!self.next_line(){return None;}}self.pos+=1;Some(self.buf[self.pos-1])}
	fn vb(&mut self)->Vec<u8>{let mut s=v!([10]);let mut f=false;while let Some(c)=self.byte(){
		if!c.is_ascii_whitespace(){s.push(c);f=true;}else if f{break;}}s}
	fn p<T:FromStr>(&mut self)->T where T::Err:Debug{let w=self.vb();str::from_utf8(w.as_ref()).unwrap().parse::<T>().unwrap()}
	fn u(&mut self) ->  usize { self.p() }
	fn f(&mut self) ->    f64 { self.p() }
}impl Drop for Reader{fn drop(&mut self){unsafe{Box::from_raw(self.x)};}}
//----------}}}

fn main() {
	let (mut rin,mut rout) = rio();

	let n = rin.u();
	let p = rin.f();
	let nn = n as f64;
	for x in 0..n {
		let xx = x as f64;
		let res = xx/nn*(xx-1.0)/(nn-2.0) + (nn-1.0-xx)/nn*xx/(nn-2.0) + 1.0/nn*xx/(nn-1.0);
		if res + 1e-9 > p {
			writeln!(rout, "{}", x).unwrap();
			return;
		}
	}
}


//spnauti-rusT {{{
#[allow(unused_imports)]use std::{io::*,collections::*,fmt::Debug,str::{self,*},cmp::*,ops::{self,*},iter::{self,*}};
macro_rules!v{
	($(:$t:ty)?=$e:expr)=>{$e$(as$t)?};([$d:expr]$(:$t:ty)?)=>{Vec::$(<$t>::)?with_capacity($d)};
	([]$(:$t:ty)?)=>{Vec::$(<$t>::)?new()};([$d:expr]$($s:tt)+)=>{vec![v!($($s)+);$d]};}
fn rio()->(Reader,BufWriter<Stdout>){(Reader::new(),BufWriter::new(stdout()))}
struct Reader{buf:Vec<u8>,pos:usize,x:*mut Stdin,q:StdinLock<'static>}//'
#[allow(dead_code)]impl Reader{
	fn new()->Self{let x=Box::into_raw(Box::new(stdin()));let q=unsafe{&*x}.lock();Self{x,q,buf:v!([]),pos:0}}
	fn next_line(&mut self)->bool{self.buf.clear();self.pos=0;self.q.read_until(b'\n',&mut self.buf).unwrap_or(0)>0}
	fn byte(&mut self)->Option<u8>{
		if self.pos==self.buf.len(){if!self.next_line(){return None;}}self.pos+=1;Some(self.buf[self.pos-1])}
	fn vb(&mut self)->Vec<u8>{let mut s=v!([10]);let mut f=false;while let Some(c)=self.byte(){
		if!c.is_ascii_whitespace(){s.push(c);f=true;}else if f{break;}}s}
	fn p<T:FromStr>(&mut self)->T where T::Err:Debug{let w=self.vb();str::from_utf8(w.as_ref()).unwrap().parse::<T>().unwrap()}
	fn u(&mut self) ->  usize { self.p() }
	fn f(&mut self) ->    f64 { self.p() }
}impl Drop for Reader{fn drop(&mut self){unsafe{Box::from_raw(self.x)};}}
//----------}}}

fn main() {
	let (mut rin,mut rout) = rio();

	let n = rin.u();
	let p = rin.f();
	let mut lo = 0;
	let mut hi = n-2;
	let mut ans = n - 1;
	while lo <= hi {
		let x = (lo + hi) / 2;
		let mut res = 0.0;
		let mut c = 0;
		for i in 0..=3 {
			let j = 3 - i;
			if i > x || j > n-x {
				continue;
			}
			let cc = if i == 0 {
				(n-x) * (n-x-1) * (n-x-2) / 6
			} else if i == 1 {
				x * (n-x) * (n-x-1) / 2
			} else if i == 2 {
				x * (x-1) * (n-x) / 2
			} else {
				x * (x-1) * (x-2) / 6
			};
			let pp = if i == 0 {
				0.0
			} else if i == 1 {
				0.5
			} else {
				1.0
			};
			res += pp * (cc as f64);
			c += cc;
		}
		res /= c as f64;
		if res + 1e-9 > p {
			ans = x;
			hi = x-1;
		} else {
			lo = x+1;
		}
	}
	writeln!(rout, "{}", ans).unwrap();
}


use std::str::FromStr;
use std::io;

fn read_line<T: FromStr>() -> Vec<T>
    where
        T::Err: std::fmt::Debug
{
    let mut input = String::new();
    io::stdin().read_line(&mut input).unwrap();
    input.trim()
        .split(' ')
        .map(|x| x.parse::<T>().unwrap())
        .collect()
}

fn c(n: i64, k: i64) -> i64 {
    if k > n {
        return 0;
    }
    let mut result = 1;
    if k > n - k {
        for i in k + 1..n + 1 {
            result *= i;
        }
        for i in 1..n - k + 1 {
            result /= i;
        }
    }
    if k <= n - k {
        for i in n - k + 1..n + 1 {
            result *= i;
        }
        for i in 1..k + 1 {
            result /= i;
        }
    }
    return result;
}

fn main() {
    let input = read_line::<String>();
    let n = input[0].parse::<i64>().unwrap();
    let p = input[1].parse::<f64>().unwrap();
    let p_int = (p * 10000.0).round() as i64;
    for k in 0..n + 1 {
        let numerator = 3 * (c(k, 3) + c(k, 2) * c(n - k, 1)) + c(k, 1) * c(n - k, 2) * 2;
        if numerator * 10000 >= p_int * 3 * c(n, 3) {
            println!("{}", k);
            return
        }
    }
}