#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<iostream>

#include<map>

#define ll long long

ll c[][],A,B,C,Gcd;

int tot;

ll read(){

    ll t=,f=;char ch=getchar();

    while (ch<''||ch>''){if (ch=='-') f=-;ch=getchar();}

    while (''<=ch&&ch<=''){t=t*+ch-'';ch=getchar();}

    return t*f;

}

ll gcd(ll a,ll b){

    if (b==) return a;

    else return gcd(b,a%b);

}

bool superjudge(){

    if (C>A) {puts("-1");return ;}

    if (A==C||B==C){puts("");return ;}

    ll Gcd=gcd(A,B);

    if (C%Gcd!=){puts("-1");return ;}

    return ;

}

void work(ll A,ll B,ll C){

    ll t=(A-C)/B,i;

    if (A==C) return;

    c[++tot][]=A;c[tot][]=B;

    for (i=;i*<=t;i*=){

        c[++tot][]=A-i*B;c[tot][]=i*B;

        c[++tot][]=A;c[tot][]=A-*i*B;

    }

    A-=B*i;

    while (A>C){

        if (A-i*B>=C){

            c[++tot][]=A;

            c[tot][]=i*B;

            A-=i*B;

        }

        i/=;

    }

}

void get_gcd(ll A,ll B){

    if (A==Gcd||B==Gcd) return;

    work(A,B,A%B);

    get_gcd(B,A%B);

}

int main(){

    A=read();B=read();C=read();

    if (A<B)std::swap(A,B);

    if (superjudge()) return ;

    Gcd=gcd(A,B);

    get_gcd(A,B);

    work(A,Gcd,C);

    printf("%d\n",tot);

    for (int i=;i<=tot;i++)

     for (i=;i<=tot;++i)

      printf("%lld ",c[i][]),printf("%lld\n",c[i][]);

}