pub mod io {
    pub fn scan<R: std::io::BufRead>(r: &mut R) -> Vec<u8> {
        let mut res = Vec::new();
        loop {
            let buf = match r.fill_buf() {
                Ok(buf) => buf,
                Err(e) if e.kind() == std::io::ErrorKind::Interrupted => continue,
                Err(e) => panic!("{}", e), 
            };
            let (done, used, buf) = match buf.iter().position(u8::is_ascii_whitespace) {
                Some(i) => (i > 0 || res.len() > 0, i + 1, &buf[..i]),
                None => (buf.is_empty(), buf.len(), buf),
            };
            res.extend_from_slice(buf);
            r.consume(used);
            if done { return res; }
        }
    }

    #[macro_export]
    macro_rules! scan {
        ($r:expr, [$t:tt; $n:expr]) => ((0..$n).map(|_| scan!($r, $t)).collect::<Vec<_>>());
        ($r:expr, [$t:tt]) => (scan!($r, [$t; scan!($r, usize)]));
        ($r:expr, ($($t:tt),*)) => (($(scan!($r, $t)),*));
        ($r:expr, Usize1) => (scan!($r, usize) - 1);
        ($r:expr, String) => (String::from_utf8(scan!($r, Bytes)).unwrap());
        ($r:expr, Bytes) => (io::scan($r));
        ($r:expr, $t:ty) => (scan!($r, String).parse::<$t>().unwrap());
    }

    #[macro_export]
    macro_rules! input {
        ($r:expr, $($($v:ident)* : $t:tt),* $(,)?) => {
            $(let $($v)* = scan!($r, $t);)*
        };
    }
}

pub mod binary_search {
    pub trait BinarySearch<T> {
        fn lower_bound(&self, x: &T) -> usize;
        fn upper_bound(&self, x: &T) -> usize;
    }

    impl<T: PartialOrd> BinarySearch<T> for [T] {
        fn lower_bound(&self, x: &T) -> usize {
            let mut left = 0;
            let mut right = self.len();
            while left < right {
                let mid = (left + right) / 2;
                if unsafe { self.get_unchecked(mid) } < x {
                    left = mid + 1;
                } else {
                    right = mid;
                }
            }
            left
        }

        fn upper_bound(&self, x: &T) -> usize {
            let mut left = 0;
            let mut right = self.len();
            while left < right {
                let mid = (left + right) / 2;
                if unsafe { self.get_unchecked(mid) } <= x {
                    left = mid + 1;
                } else {
                    right = mid;
                }
            }
            left
        }
    }
}

use binary_search::BinarySearch;

const INF: u64 = 1 << 30;

fn run<R: std::io::BufRead, W: std::io::Write>(reader: &mut R, writer: &mut W) {
    input! {
        reader,
        n: usize, m: usize,
        x: [u64; n],
        mut y: [u64; m],
    }
    y.push(INF);

    for x in x {
        let i = y.lower_bound(&x);
        if i == m {
            writeln!(writer, "Infinity").ok();
        } else {
            writeln!(writer, "{}", y[i] - x).ok();
        }
    }
}

fn main() {
    let (stdin, stdout) = (std::io::stdin(), std::io::stdout());
    let ref mut reader = std::io::BufReader::new(stdin.lock());
    let ref mut writer = std::io::BufWriter::new(stdout.lock());
    run(reader, writer);
}