#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

fn main() {
    input!{
        k:i64,
        x:i64,
        y:i64,
    }
    let xx = x.abs();
    let yy = y.abs();
    let xv = if x < 0 {-1}else{1};
    let yv = if y < 0 {-1}else{1};
    let mut ans = vec![];
    // for xx,yy
    let mut X = xx;
    let mut Y = yy;
    let mut flag = false;
    let mut n = std::cmp::max(2, (X+Y+k-1)/k);
    if xx+yy==k{
        println!("1\n{} {}", x, y);
    }else if (n*k - (xx+yy))%2 ==1 && k%2 == 0{
        println!("-1");
    }else{
        if xx<yy {
            X=yy;
            Y=xx;
            flag =  true;
        }
        // last = 2t+2s
        if (n*k - (X+Y))%2==1 &&k%2==1{
            n+=1;
        }
        
        if n==3 {
            // n = 3
            let b = (n*k - (X+Y))/4;
            let a = (n*k - (X+Y))/2 - b;
            for i in 1..n+1 {
                let mut l = i*k;
                if l<=a {
                    ans.push((-l,0));
                }else if l<=a+Y+b {
                    l-=a;
                    ans.push((-a, l));
                }else if l<=a+Y+b+a+X {
                    l -= a+Y+b;
                    ans.push((l-a, b+Y));
                }else{
                    l-=a+Y+b+a+X;
                    ans.push((X, Y+(b-l)));
                }
            }
        }else{
            // assert_eq!(1,2);
            let a:i64 = (n*k - (X+Y))/2;
            // println!("data: n {} a {}", n, a);
            for i in 1..n+1 {
                let mut l:i64 = i*k;
                if l <= a+Y{
                    ans.push((0,l));
                }else if l <= a+X+Y {
                    l-=a+Y;
                    ans.push((l, a+Y));
                }else{
                    l-=a+Y+X;
                    ans.push((X, Y+(a-l)));
                }
            }
        }
        if flag {
            println!("{}", ans.len());
            for i in 0..ans.len(){
                println!("{} {}", xv*ans[i].1, yv*ans[i].0);
            }
        }else{
            println!("{}", ans.len());
            for i in 0..ans.len(){
                println!("{} {}", xv*ans[i].0, yv*ans[i].1);
            }
        }
    }
}

// ref: https://betrue12.hateblo.jp/entry/2019/07/28/215024

Measured memory_bytes: 11512