#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
main(){
    ll N,M;
    cin >> N >> M;
    vector<ll> V(N);
    V[0] = V[1] = 1;
    rep(i,2,N)V[i] = V[i-1] + V[i-2];
    ll dif = V[N-1] - M;
    cout << dif << endl;

    //V[N-2]までの和でdifを表せるかどうか
    map<ll,int> mp;
    mp[0] = 0;
    rep(i,0,N-1){
        map<ll,int> mp2;
        for(auto p:mp){
            rep(k,0,2){
                ll next = V[i] + p.first;
                if(k)next = p.first;
                if(next > M)continue;
                vector<int> vec;
                vec.push_back(p.second + 1);
                if(mp2.find(next) != mp2.end() )vec.push_back(mp2[next]);
                if(mp.find(next) != mp.end() )vec.push_back(mp[next]);
                int mini = INF;
                for(auto i:vec)mini = min(mini, i);
                mp2[next] = mini;
            }
        }
        //mp = mp2;

        mp.clear();
        for(auto p:mp2){
            mp[p.first] = p.second;
           // cout << p.first << " " << p.second << endl;
        }
        //cout << "-----" << endl;
    }
    for(auto p:mp){
        //cout << p.first << " " << p.second << endl;
    }
    if(mp.find(dif) != mp.end())cout << mp[dif] << endl;
    else                      cout << -1 << endl;
}