#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D(#__VA_ARGS__ " = "), debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

using namespace std;

int mod;

int fpw(int a, int p = mod - 2) {
  int res = 1;
  while (p) {
    if (p & 1) res = 1ll * res * a % mod;
    a = 1ll * a * a % mod, p >>= 1;
  }
  return res;
}

void work() {
  int a, b, c, d;
  cin >> a >> b >> c >> d;
  if ((a + b) % mod != (c + d) % mod) return cout << "-1\n", void();
  int w = (a + b) % mod, inv = fpw(w);
  a = 1ll * a * inv % mod, c = 1ll * c * inv % mod;
  int ans = 0;
  while (true) {
    ll lim = (1ll << ans) - 1;
    if ((a - c + mod) % mod <= lim) return cout << ans << "\n", void();
    ans++, a = 2 * a % mod;
  }
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  int t; cin >> mod >> t;
  while (t--) work();
}