fn main() { use std::io::Read; let mut buf = String::new(); std::io::stdin().read_to_string(&mut buf).unwrap(); let mut iter = buf.split_whitespace(); let s: String = iter.next().unwrap().parse::().unwrap(); let m: usize = iter.next().unwrap().parse::().unwrap(); let mut cnt = 0; for _ in 0..m { let c: String = iter.next().unwrap().parse::().unwrap(); cnt += search_rh(s.as_bytes(), c.as_bytes()).len(); } println!("{}", cnt); } #[doc = " O(len(base) + len(key))"] #[allow(dead_code)] pub fn search_rh + std::clone::Clone>(base: &[T], key: &[T]) -> Vec { use std::num::Wrapping; const B: Wrapping = Wrapping(1_000_000_007u64); let key_len = key.len(); let base_len = base.len(); if key_len > base_len { return vec![]; } let mut t = Wrapping(1u64); for _ in 0..key_len { t *= B; } let mut key_h = Wrapping(0u64); let mut base_h = Wrapping(0u64); for i in 0..key_len { key_h = key_h * B + Wrapping(key[i].clone().into()); base_h = base_h * B + Wrapping(base[i].clone().into()); } let mut ret = vec![]; { let mut i = 0; while i + key_len <= base_len { if key_h == base_h { ret.push(i); } if i + key_len < base_len { base_h = base_h * B + Wrapping(base[i + key_len].clone().into()) - Wrapping(base[i].clone().into()) * t; } i += 1; } } ret }