#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

vector<ll> f(ll X, ll Y, ll Z);

void solve();
// CITRUS CURIO CITY / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

vector<ll> fib = {1, 1};

vector<ll> f(ll X, ll Y, ll Z){
    if (X == 0){
        if (Y == 0){
            if (Z == 0) return {0, 0, 0};
            return {0, Z, Z, 0};
        }
        if (Z == 0){
            return {0, Y, Y, 0, Y};
        }
        rep(i, 1, fib.size()) if (Y % fib[i] == 0){
            vector<ll> p = {0ll};
            rep(j, 0, i + 1) p.push_back((Y / fib[i]) * fib[j]);
            rep(j, 1, (int)(p.size()) - 1){
                if (Z == p[j]) return p;
            }
        }
        return {-1};
    }
    if (Y == 0) f(Y, X, Z);

    const int lim = 167167;
    vector<ll> res(lim);

    // p の末尾を最小値として、どんどん上がっていく
    auto ch = [&](vector<ll> p) -> void {
        int m = p.size();
        rep(rp, 0, 2){
            ll a = p[m - 1] + p[m - 2];
            if (rp){
                a = p[m - 2] - p[m - 1];
                if (a < p[m - 1]){
                    continue;
                }
            }
            vector<ll> q = p;
            q.push_back(a);
            while (q.back() < Y){
                int n = q.size();
                if (q[n - 1] + q[n - 2] == 0) break;
                q.push_back(q[n - 1] + q[n - 2]);
            }
            if (q.back() == Y){
                if (res.size() > q.size()) res = q;
            }
        }
    };
    rep(rp, 0, 2){
        swap(X, Y);
        // X > ? > ? > ... > Z > ? > ... ? > ? < ? ... ? < Y
        if (X >= Z){
            rep(i, 1, fib.size()){
                // cout << i << endl;
                ll zz = Z * fib[i - 1];
                if (zz > X) break;
                if ((X - zz) % fib[i]) continue;
                ll fr = (X - zz) / fib[i];
                if (fr < Z) continue;
                // cout << Z << " " << fr << endl;
                vector<ll> p = {Z, fr};
                while (p.back() < X){
                    int m = p.size();
                    p.push_back(p[m - 1] + p[m - 2]);
                }
                reverse(all(p));
                while (true){
                    ch(p);
                    int m = p.size();
                    ll tmp = p[m - 2] - p[m - 1];
                    if (p.back() < tmp) break;
                    p.push_back(tmp);
                    ch(p);
                }
            }
        }
        // X > Z > ? ...
        if (X >= Z){
            vector<ll> p = {X, Z};
            while (true){
                assert((int)p.size() != lim);
                auto q = p;
                int m = p.size();
                // cout << q.size() << endl;
                // vec_out(q);
                ch(q);
                ll tmp = p[m - 2] - p[m - 1];
                if (tmp > p[m - 1]){
                    break;
                }
                p.push_back(tmp);
            }
        }
    }
    if ((int)res.size() == lim) return {-1};
    if (res[0] != X) reverse(all(res));
    return res;
}

void solve(){
    ll X, Y, Z;
    cin >> X >> Y >> Z;
    while (fib.back() <= 1'000'000'000'000ll){
        int m = fib.size();
        fib.push_back(fib[m - 2] + fib[m - 1]);
    }
    auto ans = f(X, Y, Z);
    if (ans[0] == -1) cout << "-1\n";
    else vec_out(ans, 1);
}