#include <bits/stdc++.h>
using namespace std;
const int N = 55;
long long dp[N];
int main() {
  int n;
  long long k;
  dp[0] = 1, dp[1] = 1;
  for (int i = 2; i < N; i++) dp[i] = dp[i - 1] + dp[i - 2];
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    if (k > dp[n - i])
      cout << i + 1 << " " << i << " ", k -= dp[n - i], i++;
    else
      cout << i << " ";
  }
  return 0;
}
