import sys
#input = sys.stdin.readline #文字列につけてはダメ
#input = sys.stdin.buffer.readline #文字列につけてはダメ
#sys.setrecursionlimit(1000000)
#import bisect
#import itertools
#import random
from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
#MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]


def main():
    P,Q,x,y = map(int,input().split())
    MAX = pow(10,5) + 100
    #1の位が0だとReverseできない
    if y%10 == 0:
        y += Q
    y = list(str(y))
    ry = list(reversed(y))
    ry = "".join(ry)
    ry = int(ry)
    v = ry%P
    for i in range(MAX):
        if v%P == x:
            ans = str(ry) + "0" * i
            print(ans)
        v *= 10
        v %= P
        #print(v)
        
if __name__ == '__main__':
    main()