#include <iostream>

#include <algorithm>

#include <cstdio>

#include <set>

#include <map>

#include <queue>

#define PER(i,a,n) for(int i=n;i>=a;--i)

#define REP(i,a,n) for(int i=a;i<=n;++i)

#define hr cout<<'\n'

#define x first

#define y second

#define endl '\n'

using namespace std;

typedef long long ll;

typedef pair<int,int> pii;

int P;

ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}

ll qpow(ll a,ll n) {ll r=1%P;for (a%=P;n;a=a*a%P,n>>=1)if(n&1)r=r*a%P;return r;}

void exgcd(ll a,ll b,ll &d,ll &x,ll &y){b?exgcd(b,a%b,d,y,x),y-=a/b*x:x=1,y=0,d=a;}

ll inv(ll x){return x<=1?1:inv(P%x)*(P-P/x)%P;}

//head

const int N = 4e5+10;

int a[N], b[N], c[N], vis[N], f[N], n, m, k, t;

vector<int> g[N];

map<int,pii> d1, d2;

void ins(int x, int y, int op, map<int,pii> &d, queue<int> &q) {

	if (d.count(x)) return;

	d[x]={d[y].x+1,op};

	q.push(x);

}

void bfs(int x, map<int,pii> &d) {

	queue<int> q;

	q.push(x);

	d[x]={0,-1};

	REP(i,1,800000) {

		if (q.empty()) break;

		int u = q.front();q.pop();

		ins((u+1)%P,u,1,d,q),ins((u+P-1)%P,u,2,d,q),ins(inv(u),u,3,d,q);

	}

}

int buf[N];

void pr(int x, int y, map<int,pii> &d) {

	*buf = 0;

	while (x!=y) {

		buf[++*buf] = d[x].y;

		if (d[x].y==1) x = (x+P-1)%P;

		else if (d[x].y==2) x = (x+1)%P;

		else x = inv(x);

	}

}

int main() {

	cin>>n>>m>>P;

	bfs(n,d1),bfs(m,d2);

	for (auto &&it:d1) {

		if (d2.count(it.x)) {

			int ans = it.y.x+d2[it.x].x;

			if (ans>200) continue;

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

			pr(it.x,n,d1);

			PER(i,1,*buf) cout<<buf[i]<<' ';

			pr(it.x,m,d2);

			REP(i,1,*buf) {

				if (buf[i]==1) buf[i]=2;

				else if (buf[i]==2) buf[i]=1;

				cout<<buf[i]<<' ';

			}hr;

			return 0;

		}

	}

}